Automatically presented groups.
amenabilityCayley topologyfinitely presented groupsGrigorchuk topologygroups generated by finite state automataHaagerup propertynilpotent groupspiecewise automatically presented groupspolycyclic groupsproperty \(T\)word problem
Groups acting on trees (20E08) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Periodic groups; locally finite groups (20F50) Geometric group theory (20F65) Asymptotic properties of groups (20F69) Means on groups, semigroups, etc.; amenable groups (43A07) Topological methods in group theory (57M07)
Summary: We introduce the notions of automatically presented groups and piecewise automatically presented groups. We show that if \(G\) is a piecewise automatically presented group satisfying the property \(T\) of Kazhdan, then \(G\) is finite. We prove that if \(G\) is amenable and finitely presented, then \(G\) is virtually Abelian. We give further restrictions for a group to be piecewise automatically presented and study properties of such groups. We also give examples of automatically presented groups.
- 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
- The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet
- 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 concept of duality for automata over a changing alphabet and generation of a free group by such automata
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)