HNN extensions and stackable groups

DOI10.4171/GGD/467MaRDI QIDQ1785957zbMATH OpenOpenAlexFDO

Authors Conchita Martínez-Pérez, Susan Hermiller

Publication date 21 September 2018

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

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

zbMATH Keywords

algorithms in groups theoryDehn functionHNN extension

Mathematics Subject Classification ID

Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Geometric group theory (20F65)

Abstract: Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability, which implies solvability of the word problem. In this paper we give two new characterizations of the stackable property for groups, and use these to show that every HNN extension of a stackable group is stackable. We apply this to exhibit a wide range of Dehn functions that are admitted by stackable and autostackable groups, as well as an example of a stackable group with unsolvable word problem. We use similar methods to show that there exist finitely presented metabelian groups that are non-constructible but admit an autostackable structure.

Review text

Summary: Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability, which implies solvability of theword problem. In this paperwe give two newcharacterizations of the stackable property for groups, and use these to show that every HNN extension of a stackable group over finitely generated subgroups is stackable. We apply this to exhibit a wide range of Dehn functions that are admitted by stackable and autostackable groups, as well as an example of a stackable group with unsolvable word problem. We use similarmethods to show that there exist finitely presented metabelian groups that are non-constructible but admit an autostackable structure.

Recommendations

• Homology and closure properties of autostackable groups
• Algorithms and topology of Cayley graphs for groups.
• A uniform model for almost convexity and rewriting systems
• Autostackability of Thompson's group \(F\)
• Solvable groups with polynomial Dehn functions

Cited in

(6)

• Geometry of the word problem for 3-manifold groups
• n-Groupoids and Stacky Groupoids
• scientific article; zbMATH DE number 549529 (Why is no real title available?)
• HNN EXTENSION OF CYCLICALLY PRESENTED GROUPS
• A uniform model for almost convexity and rewriting systems
• Homology and closure properties of autostackable groups

This page was built for publication: HNN extensions and stackable groups

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