2000 character limit reached
Aperiodic Subshifts on Polycyclic Groups
Published 8 Oct 2015 in cs.DM and math.GR | (1510.02360v2)
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].
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.