On dynamical finiteness properties of algebraic group shifts
Xuan Kien Phung

TL;DR
This paper introduces algebraic group subshifts over groups and demonstrates their properties, extending classical results to broader non-compact group alphabets, especially for polycyclic-by-finite groups.
Contribution
It defines algebraic group subshifts and proves their equivalence with sofic and finite type subshifts over certain groups, generalizing existing dynamical systems results.
Findings
Algebraic group subshifts generalize existing classes of subshifts.
The descending chain condition holds for $V^G$ when $G$ is polycyclic-by-finite.
Equivalence of algebraic, sofic, and finite type subshifts in this setting.
Abstract
Let be a group and let be an algebraic group over an algebraically closed field. We introduce algebraic group subshifts which generalize both the class of algebraic sofic subshifts of and the class of closed group subshifts over finite group alphabets. When is a polycyclic-by-finite group, we show that satisfies the descending chain condition and that the notion of algebraic group subshifts, the notion of algebraic group sofic subshifts, and that of algebraic group subshifts of finite type are all equivalent. Thus, we obtain extensions of well-known results of Kitchens and Schmidt to cover the case of many non-compact group alphabets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · semigroups and automata theory · graph theory and CDMA systems
