Homology and closure properties of autostackable groups

DOI10.1016/J.JALGEBRA.2015.11.053zbMath1380.20041arXiv1506.00071OpenAlexW2962969571MaRDI QIDQ5964517

Susan M. Hermiller, Ashley Johnson, Mark Brittenham

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

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

Related Items (1)

Geometry of the word problem for 3-manifold groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms and topology of Cayley graphs for groups.
• A uniform model for almost convexity and rewriting systems
• Complete rewriting systems and homology of monoid algebras
• Automatic groups and amalgams
• The Anick resolution
• Artin groups, rewriting systems and three-manifolds
• Algorithms and geometry for graph products of groups
• The loop shortening property and almost convexity.
• On linear and residual properties of graph products
• Combinatorial group theory.
• A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
• Tame filling invariants for groups
• 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
• Minimal almost convexity
• A Finitely Presented Group Whose 3-Dimensional Integral Homology is not Finitely Generated

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