Combing Euclidean buildings.

DOI10.2140/gt.2000.4.85zbMath1047.20031arXivmath/0001186OpenAlexW3105065251MaRDI QIDQ1978051

Guennadi A. Noskov

Publication date: 7 June 2000

Published in: Geometry \& Topology (Search for Journal in Brave)

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

zbMATH Keywords

automatic groupsEuclidean buildingscombings

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Buildings and the geometry of diagrams (51E24) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groups with a (BN)-pair; buildings (20E42)

Related Items

2-dimensional Coxeter groups are biautomatic, Coronas for properly combable spaces, Group actions on non-Archimedean trees, cube complexes and automata, Regular path systems and (bi)automatic groups., On the Hochschild homology of \(\ell^1\)-rapid decay group algebras, Weakly Modular Graphs and Nonpositive Curvature

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small cancellation theory and automatic groups
• Small cancellation theory and automatic groups. II
• Polygonal complexes and combinatorial group theory
• The geometry of cube complexes and the complexity of their fundamental groups
• Hyperbolic buildings, affine buildings, and automatic groups
• Bicombing of triangular buildings
• AUTOMATIC STRUCTURES AND BOUNDARIES FOR GRAPHS OF GROUPS