Diagram of Geodesic Intervals in C'(1/8)-Groups

Abstract

Let Γ be a group characterized by a small cancellation C'(1/8)-presentation. We study the structure of its Cayley graph, specifically geodesic intervals and digons. We prove that all geodesic segments [x,y] of length n can be covered by finitely many simple geodesic digons with pairwise C'(1/8)-short lower intersections whose lower sides lie on a common geodesic segment [x,y]. This is a generalization of a proposition of Kharlampovich-Sklinos (arXiv:2106.05461) for random groups. We then bound this resulting diagram of digons, showing that the total perimeter of its cells and its edge count is bounded by n, and the cycle rank is equal to the number of distinct cell contours. Thus, although there may be many different geodesics, the size of their union is bounded linearly in the distance between their endpoints. The constant is independent of the number and lengths of the defining relators. In particular, the estimate applies to infinite presentations with unbounded relator lengths. From this we get a consequence for growth, allowing us to compare the number of geodesic words with the number of group elements of the same length.

Conjugacy and period in symmetric diagram groups
Matteo Tarocchi
arXiv4 Oct 2026PreprintarXiv licenceFull textAlgebra & number theoryarXiv
Compact Quantum Metric Spaces from Weakly Geodesic Length Functions on Hyperbolic Groups
Are Austad
arXiv28 Aug 2026PreprintCC BY 4.0Full textAnalysis & PDEsarXiv
Bounded Bruhat intervals and affine Coxeter groups
Grant T. Barkley, Christian Gaetz
arXiv30 Oct 2026PreprintarXiv licenceFull textAlgebra & number theory Combinatorics & discrete mathematicsarXiv
Integrable and non-integrable LR geodesic flows on 5-dimensional 2-step nilpotent Lie groups
Milan Pavlović, Tijana Šukilović
arXiv29 Oct 2026PreprintCC BY-NC-ND 4.0Full textDynamical systems Geometry & topologyarXiv
Fast factorization in diagram monoids
Matthias Fresacher, Willow Stewart, Daniel Tubbenhauer
arXiv25 Sep 2026PreprintarXiv licenceFull textAlgebra & number theory Combinatorics & discrete mathematicsarXiv

Cite

BibTeX RIS

BibTeX

@misc{hoffmann2026diagram,
  title = {{Diagram of Geodesic Intervals in $C'(1/8)$-Groups}},
  author = {Alexander Hoffmann},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.00095},
  eprint = {2611.00095},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.00095},
  note = {CC BY 4.0},
}

RIS

TY  - UNPB
TI  - Diagram of Geodesic Intervals in C'(1/8)-Groups
AU  - Alexander Hoffmann
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.00095
UR  - https://arxiv.org/abs/2611.00095
AB  - Let Γ be a group characterized by a small cancellation C'(1/8)-presentation. We study the structure of its Cayley graph, specifically geodesic intervals and digons. We prove that all geodesic segments [x,y] of length n can be covered by finitely many simple geodesic digons with pairwise C'(1/8)-short lower intersections whose lower sides lie on a common geodesic segment [x,y]. This is a generalization of a proposition of Kharlampovich-Sklinos (arXiv:2106.05461) for random groups. We then bound this resulting diagram of digons, showing that the total perimeter of its cells and its edge count is bounded by n, and the cycle rank is equal to the number of distinct cell contours. Thus, although there may be many different geodesics, the size of their union is bounded linearly in the distance between their endpoints. The constant is independent of the number and lengths of the defining relators. In particular, the estimate applies to infinite presentations with unbounded relator lengths. From this we get a consequence for growth, allowing us to compare the number of geodesic words with the number of group elements of the same length.
ER  -

Abstract

Related

Cite