2000 character limit reached
Aperiodic Subshifts on Polycyclic Groups (1510.02360v2)
Published 8 Oct 2015 in cs.DM and math.GR
Abstract: We prove that every polycyclic group of nonlinear growth admits a strongly aperiodic SFT and has an undecidable domino problem. This answers a question of [4] and generalizes the result of [2].