Automata groups generated by Cayley machines of groups of nilpotency class two
Ning Yang

TL;DR
This paper investigates automata groups generated by Cayley machines of finite nilpotent class two groups, revealing that these automata groups are all cross-wired lamplighters, thus expanding understanding of their structure.
Contribution
It provides explicit presentations of these automata groups and establishes their classification as cross-wired lamplighters, a novel insight into their algebraic structure.
Findings
Automata groups are all cross-wired lamplighters.
Explicit presentations of these groups are provided.
The groups exhibit specific algebraic properties related to nilpotency.
Abstract
We show presentations of automata groups generated by Cayley machines of finite groups of nilpotency class two and these automata groups are all cross-wired lamplighters.
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 · Cellular Automata and Applications · graph theory and CDMA systems
