Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1212.2618

Surface subgroups from linear programming

Danny Calegari·Alden Walker
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show that certain classes of graphs of free groups contain surface subgroups, including groups with positive $b_2$ obtained by doubling free groups along collections of subgroups, and groups obtained by "random" ascending HNN extensions of free groups. A special case is the HNN extension associated to the endomorphism of a rank 2 free group sending a to ab and b to ba; this example (and the random examples) answer in the negative well-known questions of Sapir. We further show that the unit ball in the Gromov norm (in dimension 2) of a double of a free group along a collection of subgroups is a finite-sided rational polyhedron, and that every rational class is virtually represented by an extremal surface subgroup. These results are obtained by a mixture of combinatorial, geometric, and linear programming techniques.

Explore related subjects

math.GRmath.DSmath.GT

Keep this discovery

BibTeXRIS

Danny Calegari, Alden Walker. 2012-12-11. Surface subgroups from linear programming. https://doi.org/10.1215/00127094-2877511

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↗