Flow Equivalence of G-SFTs
Mike Boyle, Toke Meier Carlsen, S{\o}ren Eilers

TL;DR
This paper classifies G-shifts of finite type up to flow equivalence using algebraic invariants, providing explicit classifications for certain cases and connecting to cellular automata involutions.
Contribution
It introduces an algebraic framework for classifying G-SFTs up to equivariant flow equivalence, including explicit invariants for specific cases.
Findings
Classification reduces to algebraic invariants of poset-blocked matrices over group rings.
Explicit invariants computed for two irreducible components with G=Z_2.
Connections established between G-SFTs and cellular automata involutions.
Abstract
In this paper, a G-shift of finite type (G-SFT) is a shift of finite type together with a free continuous shift-commuting action by a finite group G. We reduce the classification of G-SFTs up to equivariant flow equivalence to an algebraic classification of a class of poset-blocked matrices over the integral group ring of G. For a special case of two irreducible components with G, we compute explicit complete invariants. We relate our matrix structures to the Adler-Kitchens-Marcus group actions approach. We give examples of G-SFT applications, including a new connection to involutions of cellular automata.
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.
