Torsion subgroups of groups with quadratic Dehn function
\(S\)-machinecongruence extension property.finitely presented groupsfree Burnside groupsgenerators and relations in groupsquasi-isometric embeddingthe Dehn function of a groupvan Kampen diagram
Research exposition (monographs, survey articles) pertaining to group theory (20-02) Generators, relations, and presentations of groups (20F05) Cancellation theory of groups; application of van Kampen diagrams (20F06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Periodic groups; locally finite groups (20F50) Geometric group theory (20F65)
The \textit{Dehn function} \(\delta(n)\) of a finitely presented group measures the maximal number of conjugates of relators needed to express a word of length \(n\) representing the identity. It is linear for word-hyperbolic groups and otherwise at least quadratic. It is a tantalizing and still entirely open problem to characterize in any way those groups with quadratic Dehn function; this class includes all automatic groups in the sense of \textit{D. B. A. Epstein} et al. [Word processing in groups. Boston, MA etc.: Jones and Bartlett Publishers (1992; Zbl 0764.20017)] and also groups with unsolvable conjugacy problem.\N\NThe present monograph highlights the richness of the class of groups with quadratic Dehn function, as follows: Recall that the \textit{free Burnside group} \(B(m,n)\) is the group with \(m\) generators and all \(n\)th powers as relators; so it is the freest \(m\)-generated group with exponent \(n\). This group is infinite for \(m>1\) and odd \(n\ge 665\). Since \(B(m,n)\) is recursively presented, it may be embedded in a finitely presented group; but this group cannot be word-hyperbolic as soon as \(B(m,n)\) is infinite, so the best one can hope for is an embedding of \(B(m,n)\) in a finitely presented group with quadratic Dehn function. This is the main result of the monograph.\N\NFurthermore, the author shows that the embedding \(B(m,n)\hookrightarrow G\) he constructs enjoys some extra properties: it is bi-Lipschitz for the word metric and satisfies the \textit{congruence extension property}: every epimorphism \(B(m,n)\twoheadrightarrow Q\) extends to an epimorphism \(G\twoheadrightarrow R\) for some group \(R\hookleftarrow Q\).\N\NThe main step is a construction of an appropriate ``\(S\)-machine -- a description of a multitape Turing machine that is especially well suited to group-theoretical arguments. This machine, on the one hand, recognizes a presentation of \(B(m,n)\); and, on the other hand, leads to a finite presentation of \(G\), along with control over the shape of its van Kampen diagrams.
- Algorithmic and asymptotic properties of groups.
- CEP-Subgroups of Free Burnside Groups of Large Odd Exponents
- Combinatorial algebra: syntax and semantics. With contributions by Victor S. Guba and Mikhail V. Volkov
- Conjugacy problem in groups with quadratic Dehn function
- Embeddings of relatively free groups into finitely presented groups
- Groups with small Dehn functions and bipartite chord diagrams.
- Groups with undecidable word problem and almost quadratic Dehn function. (With an appendix written by M. V. Sapir)
- scientific article; zbMATH DE number 3648963 (Why is no real title available?)
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 51735 (Why is no real title available?)
- scientific article; zbMATH DE number 3525394 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 849253 (Why is no real title available?)
- scientific article; zbMATH DE number 3220420 (Why is no real title available?)
- HYPERBOLICITY OF GROUPS WITH SUBQUADRATIC ISOPERIMETRIC INEQUALITY
- Infinite Burnside groups of even exponent
- Isoperimetric and isodiametric functions of groups
- Isoperimetric functions of groups and computational complexity of the word problem
- LENGTH AND AREA FUNCTIONS ON GROUPS AND QUASI-ISOMETRIC HIGMAN EMBEDDINGS
- Non-amenable finitely presented torsion-by-cyclic groups.
- On finite and locally finite subgroups of free Burnside groups of large even exponents
- On some lemmas in the theory of groups.
- On subgroup distortion in finitely presented groups
- Polynomially-bounded Dehn functions of groups
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- The conjugacy problem and Higman embeddings
- THE FREE BURNSIDE GROUPS OF SUFFICIENTLY LARGE EXPONENTS
This page was built for publication: Torsion subgroups of groups with quadratic Dehn function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6927128)
