Algorithms and topology of Cayley graphs for groups.

DOI10.1016/j.jalgebra.2014.06.001zbMath1305.20051arXiv1307.4981OpenAlexW2028398007MaRDI QIDQ404175

Mark Brittenham, Susan M. Hermiller, Derek F. Holt

Publication date: 4 September 2014

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

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

zbMATH Keywords

3-manifoldsfinitely generated groupsCayley graphsword problemrewriting systemsautomatic groupsfinite presentationsvan Kampen diagramsautostackable groups

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Grammars and rewriting systems (68Q42) Fundamental group, presentations, free differential calculus (57M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

Lamplighter groups and automata ⋮ Geometry of the word problem for 3-manifold groups ⋮ Autostackability of Thompson's group \(F\) ⋮ Homology and closure properties of autostackable groups ⋮ Cayley polynomial-time computable groups

Cites Work

• The geometry of the word problem for finitely generated groups.
• Rewriting systems in alternating knot groups with the Dehn presentation
• A catalogue of complete group presentations
• Artin groups, rewriting systems and three-manifolds
• Rewriting systems and geometric three-manifolds
• A finiteness property and an automatic structure for Coxeter groups
• Rewriting systems of Coxeter groups
• Algorithms and geometry for graph products of groups
• Geodesic automation and growth functions for Artin groups of finite type
• Formal language theory and the geometry of 3-manifolds
• Combinatorial group theory.
• Artin groups of extra-large type are biautomatic
• From automatic structures to automatic groups.
• Automatic quotients of free groups.
• Sol Geometry Groups are not Asynchronously Automatic
• Artin groups of large type are shortlex automatic with regular geodesics
• TWO AUTOMATIC SPANNING TREES IN SMALL CANCELLATION GROUP PRESENTATIONS
• Soluble groups with a finite rewriting system
• On Group-Theoretic Decision Problems and Their Classification. (AM-68)
• Measuring the tameness of almost convex groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item