Self-similar groups, automatic sequences, and unitriangular representations
R. Grigorchuk, Y. Leonov, V. Nekrashevych, V. Sushchansky

TL;DR
This paper explores the connection between self-similar groups, automatic sequences, and linear representations, revealing that automaton-generated groups produce automatic matrices and that p-adic actions lead to infinite triangular matrix representations.
Contribution
It establishes a novel link between automaton-generated groups and automatic sequences, and characterizes linear representations of p-adic automorphism groups as infinite triangular matrices.
Findings
Automaton-generated groups produce automatic matrices.
p-adic automorphisms correspond to infinite triangular matrix representations.
The work relates automorphism height to matrix structure.
Abstract
We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two separate notions of automaticity: groups generated by automata and automatic sequences. We also show that if the group acts on the tree by -adic automorphisms, then the corresponding linear representation is a representation by infinite triangular matrices. We relate this observation with the notion of height of an automorphism of a rooted tree due to L.Kaloujnine.
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
TopicsGeometric and Algebraic Topology · Advanced Operator Algebra Research · semigroups and automata theory
