SearcharxivSearch

arXiv · 2606.31774

Thurston norm, polytopes and splitting complexity

Abstract

Let $G$ be a finitely generated torsion-free group satisfying the Strong Atiyah Conjecture. Assuming that $b_1^{(2)}(G)=0$, we associate to each surjective integral character $\phi$ the quantity $b_1^{(2)}(\ker \phi)$. We prove that the resulting function extends to a seminorm on $H^1(G;\mathbb{R})$ and is the thickness function of a polytope in $H_1(G;\mathbb{R})$. More generally, assuming that $G$ is of type $\mathrm{FP}_k(\mathbb{Q})$ and has $b_k^{(2)}(G)=0$, we prove that the function assigning $b_k^{(2)}(\ker \phi)$ to each surjective integral character $\phi$ is likewise the thickness function of a polytope. This confirms a conjecture of Friedl, L\"uck, and Tillmann. For torsion-free virtually (finitely generated free)-by-cyclic groups, we relate the resulting invariant to the $L^2$-Betti complexity of a character, thereby confirming a conjecture of Gardam and Kielak. As an application, we establish the existence of an algorithm for computing the Bieri--Neumann--Strebel invariant of free-by-cyclic groups and discuss connections with the isomorphism problem for such groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrei Jaikin-Zapirain, Monika Kudlinska, Pablo Sánchez-Peralta. 2026-06-30. Thurston norm, polytopes and splitting complexity. https://arxiv.org/abs/2606.31774

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