Automatically presented groups.

DOI10.4171/GGD/3MaRDI QIDQ2372588zbMATH OpenFDO

Authors Anna Erschler

Publication date 31 July 2007

Published in Groups, Geometry, and Dynamics (Search for Journal in Brave)

zbMATH Keywords

property \(T\)Haagerup propertynilpotent groupsamenabilitypolycyclic groupsword problemfinitely presented groupsCayley topologyGrigorchuk topologygroups generated by finite state automatapiecewise automatically presented groups

Mathematics Subject Classification ID

Groups acting on trees (20E08) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Asymptotic properties of groups (20F69) Means on groups, semigroups, etc.; amenable groups (43A07) Topological methods in group theory (57M07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Periodic groups; locally finite groups (20F50)

Recommendations

• scientific article; zbMATH DE number 665465
• Virtually Biautomatic Groups
• Automatic groups: A guided tour
• scientific article; zbMATH DE number 1032970
• scientific article; zbMATH DE number 2214015
• Piecewise automatic groups.
• STACS 2005
• scientific article; zbMATH DE number 194089
• Semi-groupes fortement automatiques.
• scientific article; zbMATH DE number 2202116

Cites work

• scientific article; zbMATH DE number 1984019 (Why is no real title available?)
• Endomorphic presentations of branch groups.
• On the spectrum of Hecke type operators related to some fractal groups
• Some solvable automaton groups.

Cited in

(7)

• The concept of duality for automata over a changing alphabet and generation of a free group by such automata
• A group of non-uniform exponential growth locally isomorphic to \(\mathrm{IMG}(z^2+i)\).
• The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata
• Amenable groups without finitely presented amenable covers
• On some universal construction of minimal topological generating sets for inverse limits of iterated wreath products of non-abelian finite simple groups
• STACS 2005
• The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet

This page was built for publication: Automatically presented groups.

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