Stable compressed-rank conjecture for Stallings graphs
Stable compressed-rank conjecture for Stallings graphs
Let ) be a basis and let be a Stallings graph. For , write for the stable compressed rank and let denote the corresponding compressed rank. Let be the set of connected -core graphs such that
and there is a morphism . A -cover of inside and a -covering have their usual graph-theoretic meanings.
Stable compressed-rank conjecture. For every Stallings graph and ,
Moreover, if a Stallings graph has a -cover of inside and , then there is a function with
and is the disjoint union, over , of an -covering of .
The stable compressed rank is not known to be integral or independent of ; 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
Sign in to submit a solution.
No solutions have been posted yet.