Abstract

Abstract We construct a two-state Mealy automaton A over the three-letter alphabet generating a regular branch group G ⁢ ( A ) {G(A)} , which surjects onto the infinite cyclic group. Some algebraic and geometric properties of the group G ⁢ ( A ) {G(A)} are derived. In particular, this group has a nearly finitary subgroup of index two, is amenable, just non-solvable, has exponential growth, and its action on the corresponding regular rooted tree is self-replicating, contracting, but it does not have the congruence subgroup property. We also derive in detail an ascending finite L-presentation for the group G ⁢ ( A ) {G(A)} .

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.