Homology and closure properties of autostackable groups

DOI10.1016/J.JALGEBRA.2015.11.053zbMATH Open1380.20041arXiv1506.00071OpenAlexW2962969571MaRDI QIDQ5964517FDOQ5964517

Susan Hermiller, Ashley Johnson, Mark Brittenham

Publication date: 29 February 2016

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

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.

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

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

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)

Cites Work

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

Cited In (1)

• Geometry of the word problem for 3-manifold 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)