To infinity and beyond

DOI10.4230/LIPICS.ICALP.2018.131MaRDI QIDQ5002818zbMATH OpenOpenAlexFDO

Authors Ines Klimann

Publication date 28 July 2021

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

zbMATH Keywords

automaton groupsexponential growthgrowth of a group

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Algebraic theory of languages and automata (68Q70)

Abstract: We prove that if a group generated by a bireversible Mealy automaton contains an element of infinite order, its growth blows up and is necessarily exponential. As a direct consequence, no infinite virtually nilpotent group can be generated by a bireversible Mealy automaton.

Recommendations

• On level-transitivity and exponential growth
• On bireversible Mealy automata and the Burnside problem
• Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups
• Generic properties in some classes of automaton groups
• Automaton semigroups: the two-state case.

Cites work

• A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
• Automaton semigroups: new constructions results and examples of non-automaton semigroups
• DEGREES OF GROWTH OF FINITELY GENERATED GROUPS, AND THE THEORY OF INVARIANT MEANS
• Groups of given intermediate word growth.
• Groups of intermediate growth: an introduction.
• Growth of finitely generated solvable groups and curvature of Riemannian manifolds
• How groups grow.
• On bireversible Mealy automata and the Burnside problem
• On level-transitivity and exponential growth
• Palindromic subshifts and simple periodic groups of intermediate growth

Cited in

(13)

• On bireversible Mealy automata and the Burnside problem
• On level-transitivity and exponential growth
• Escape to infinity
• On the existence of free subsemigroups in reversible automata semigroups
• Generic properties in some classes of automaton groups
• A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
• From the Infinitely Large to the Infinitely Small
• A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
• scientific article; zbMATH DE number 866639 (Why is no real title available?)
• Numerical upper bounds on growth of automaton groups
• Bireversible automata generating lamplighter groups
• The freeness problem for automaton semigroups
• Lamplighter groups, bireversible automata, and rational series over finite rings

This page was built for publication: To infinity and beyond

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