Delzant's \(T\)-invariant, Kolmogorov complexity and one-relator groups.

DOI10.4171/CMH/39zbMath1151.20026arXivmath/0305353MaRDI QIDQ2577076

Ilya Kapovich, Paul E. Schupp

Publication date: 3 January 2006

Published in: Commentarii Mathematici Helvetici (Search for Journal in Brave)

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

zbMATH Keywords

group presentationsfinitely presented groupsDelzant \(T\)-invariantgeneric groupsKolmogoroff complexitylengths of relatorsrandom one-relator groups

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Automorphisms of infinite groups (20E36) Complexity of computation (including implicit computational complexity) (03D15) Asymptotic properties of groups (20F69)

Related Items (9)

Random equations in free groups ⋮ Random systems of equations in free abelian groups. ⋮ Complexity andT‐invariant of Abelian and Milnor groups, and complexity of 3‐manifolds ⋮ Random equations in nilpotent groups. ⋮ Systolic invariants of groups and 2-complexes via Grushko decomposition ⋮ Systolic geometry and simplicial complexity for groups ⋮ On mathematical contributions of Paul E. Schupp ⋮ Exponentially generic subsets of groups ⋮ Algorithmic search in group theory

This page was built for publication: Delzant's \(T\)-invariant, Kolmogorov complexity and one-relator groups.