Stable compressed-rank conjecture for Stallings graphs

From papers

Let BB) be a basis and let Γ \Gamma be a Stallings graph. For dNd\in\mathbb{N}, write sπd(Γ)s\overline{\pi}_d(\Gamma) for the stable compressed rank and let π(Γ)\overline{\pi}(\Gamma) denote the corresponding compressed rank. Let Crit(Γ)\overline{\operatorname{Crit}}(\Gamma) be the set of connected BB-core graphs Δ\Delta such that

χ(Δ)=π(Γ)1-\chi(\Delta)=\overline{\pi}(\Gamma)-1

and there is a morphism ΓΔ\Gamma\to\Delta. A dd-cover of Γ\Gamma inside Γ×ΩBΔ\Gamma\times_{\Omega_B}\Delta and a f(Δ)f(\Delta')-covering have their usual graph-theoretic meanings.

Stable compressed-rank conjecture. For every Stallings graph Γ\Gamma and dNd\in\mathbb{N},

sπd(Γ)=π(Γ)1.s\overline{\pi}_d(\Gamma)=\overline{\pi}(\Gamma)-1.

Moreover, if a Stallings graph Δ\Delta has a dd-cover of Γ\Gamma inside Γ×ΩBΔ\Gamma\times_{\Omega_B}\Delta and χ(Δ)=sπd(Γ)-\chi(\Delta)=s\overline{\pi}_d(\Gamma), then there is a function f ⁣:Crit(Γ)Z1f\colon\overline{\operatorname{Crit}}(\Gamma)\to\mathbb{Z}_{\geq 1} with

ΔCrit(Γ)f(Δ)=d\sum_{\Delta'\in\overline{\operatorname{Crit}}(\Gamma)}f(\Delta')=d

and Δ\Delta is the disjoint union, over ΔCrit(Γ)\Delta'\in\overline{\operatorname{Crit}}(\Gamma), of an f(Δ)f(\Delta')-covering of Δ\Delta'.

The stable compressed rank is not known to be integral or independent of dd; the conjecture predicts both properties and describes all extremal cases as coverings of the critical graphs.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Yotam Shomroni, “Probabilistic Hanna Neumann Conjectures”, arXiv:2601.00053 (2025).

Solutions 0

No solutions have been posted yet.