Primitivity rank bound in terms of stable commutator length
Primitivity rank bound in terms of stable commutator length
Let be a word in a free group, let be its primitivity rank, and let be its stable commutator length. Primitivity-rank inequality. For any ,
In the source this is presented as equivalent to the universal character conjecture for polynomial irreducible characters of , using extremal-surface asymptotics. Its resolution is not stated.
Sources & referencesView supporting material
Primary source
Liam Hanany and Doron Puder, “Word Measures on Symmetric Groups”, arXiv:2009.00897 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.