Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1009.5531

Algebraic C(4) and T(4) groups are bi-automatic

Uri Weiss
View original source ↗Read source document ↗Export metadata ↓

Abstract

S. Gersten and H. Short have proved that if a group has a presentation which satisfies the algebraic C(4) and T(4) small-cancellation condition then the group is automatic. Their proof contains a gap which we aim to close. To do that we distinguish between algebraic small-cancellation conditions and geometric small cancellation conditions (which are conditions on the van Kampen diagrams). We show that, under certain additional requirements, geometric C(4) and T(4) small-cancellation conditions imply bi-automaticity. The additional requirements include a restriction on the labels of edges in minimal van Kampen diagrams. This, together with the so-called barycentric sub-division method proves the theorem.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Uri Weiss. 2010-09-28. Algebraic C(4) and T(4) groups are bi-automatic. https://arxiv.org/abs/1009.5531

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗
arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗
arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗