Bireversible automata generating lamplighter groups

DOI10.1112/BLMS.12772MaRDI QIDQ6096764zbMATH OpenOpenAlexFDO

Authors Dominik Francoeur

Publication date 15 September 2023

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/2206.04633

zbMATH Keywords

automatic grouplamplighter groupreversible automaton

Mathematics Subject Classification ID

Groups acting on trees (20E08) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Geometric group theory (20F65)

Abstract: For every non-trivial finite abelian group $A$, we exhibit a bireversible automaton generating the lamplighter group $AwrmathbbZ$.

Recommendations

• The lamplighter group Z₃ Z generated by a bireversible automaton
• The lamplighter group of rank two generated by a bireversible automaton
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• On groups generated by bi-reversible automata: the two-state case over a changing alphabet
• Lamplighter groups and automata

Cites work

• Automata and square complexes.
• Automata over a binary alphabet generating free groups of even rank.
• Commensurators of groups and reversible automata
• Complexity of finite semigroups
• Lamplighter groups, bireversible automata, and rational series over finite rings
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• On a series of finite automata defining free transformation groups.
• On the Burnside problem for periodic groups
• On the existence of free subsemigroups in reversible automata semigroups
• The lamplighter group Z₃ Z generated by a bireversible automaton
• The spectra of lamplighter groups and Cayley machines.
• To infinity and beyond

Cited in

(10)

• Lamplighter groups and automata
• The lamplighter group Z₃ Z generated by a bireversible automaton
• Cross-wired lamplighter groups and linearity of automata groups
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups
• The lamplighter group of rank two generated by a bireversible automaton
• On reversible automata generating lamplighter groups
• On groups of reversible automata
• Graphically discrete groups and rigidity
• Lamplighter groups, bireversible automata, and rational series over finite rings

This page was built for publication: Bireversible automata generating lamplighter groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6096764)