|
Computer Science 2015
Aperiodic Subshifts on Polycyclic GroupsAbstract: 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].
|