The cycle/non-efficient contribution bound for stable primitivity rank
The cycle/non-efficient contribution bound for stable primitivity rank
Let be a free group. Let be a non-power, let , and suppose that
is an element of such that is efficient, has a cycle as a connected component, has none, and is not efficient. Cycle/non-efficient contribution conjecture. Under these hypotheses,
This bound is the remaining technical estimate needed for the paper's asymptotic formulas for stable symmetric-group characters; proving it would show that the only leading contributions arise from the specified efficient diagrams.
Sources & referencesView supporting material
Primary source
Doron Puder, Yotam Shomroni, Danielle Ernst-West and Matan Seidel, “Stable Invariants of Words from Random Matrices”, arXiv:2311.17733 (2026).
Progress summary
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.