Homology and closure properties of autostackable groups

DOI10.1016/J.JALGEBRA.2015.11.053MaRDI QIDQ5964517zbMATH OpenOpenAlexFDO

Authors Mark Brittenham, Susan Hermiller, Ashley Johnson

Publication date 29 February 2016

Published in Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

word problemrewriting systemautomatic groupautostackablehomological finiteness condition

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Geometric group theory (20F65) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Abstract: Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to include all asynchronously automatic groups with respect to a prefix-closed normal form set, and all groups admitting finite complete rewriting systems. Although groups in the latter two classes all satisfy the homological finiteness condition $F{P}_{i}nfty$, we show that the class of autostackable groups includes a group that is not of type $F{P}_3$. We also show that the class of autostackable groups is closed under graph products and extensions.

Recommendations

• Algorithms and topology of Cayley graphs for groups.
• From automatic structures to automatic groups.
• HNN extensions and stackable groups
• Autostackability of Thompson's group \(F\)
• Geometry of the word problem for 3-manifold groups

Cites work

• scientific article; zbMATH DE number 4210420 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 53661 (Why is no real title available?)
• scientific article; zbMATH DE number 67429 (Why is no real title available?)
• scientific article; zbMATH DE number 67430 (Why is no real title available?)
• scientific article; zbMATH DE number 534859 (Why is no real title available?)
• A Finitely Presented Group Whose 3-Dimensional Integral Homology is not Finitely Generated
• A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
• A uniform model for almost convexity and rewriting systems
• Algorithms and geometry for graph products of groups
• Algorithms and topology of Cayley graphs for groups.
• Artin groups, rewriting systems and three-manifolds
• Automatic groups and amalgams
• Combinatorial group theory.
• Complete rewriting systems and homology of monoid algebras
• Minimal almost convexity
• On linear and residual properties of graph products
• On the Homology of Associative Algebras
• Soluble groups with a finite rewriting system
• String rewriting and homology of monoids
• Subgroups of finite index in groups with finite complete rewriting systems
• Tame filling invariants for groups
• The Anick resolution
• The loop shortening property and almost convexity.

Cited in

(4)

• Algorithms and topology of Cayley graphs for groups.
• Autostackability of Thompson's group \(F\)
• Geometry of the word problem for 3-manifold groups
• HNN extensions and stackable groups

This page was built for publication: Homology and closure properties of autostackable groups

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