SearcharxivSearch

arXiv · math/0305353

Delzant's T-invariant, Kolmogorov complexity and one-relator groups

Abstract

We prove that ``almost generically'' for a one-relator group Delzant's $T$-invariant (which measures the smallest size of a finite presentation for a group) is comparable in magnitude with the length of the defining relator. The proof relies on our previous results regarding isomorphism rigidity of generic one-relator groups and on the methods of the theory of Kolmogorov-Chaitin complexity. We also give a precise asymptotic estimate (when $k$ is fixed and $n$ goes to infinity) for the number $I_{k,n}$ of isomorphism classes of $k$-generator one-relator groups with a cyclically reduced defining relator of length $n$: \[ I_{k,n}\sim \frac{(2k-1)^n}{nk!2^{k+1}}. \] Here $f(n)\sim g(n)$ means that $\lim_{n\to\infty} f(n)/g(n)=1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ilya Kapovich, Paul Schupp. 2005-01-30. Delzant's T-invariant, Kolmogorov complexity and one-relator groups. https://arxiv.org/abs/math/0305353

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

KEEP EXPLORING

Related papers

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

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

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