The cycle/non-efficient contribution bound for stable primitivity rank

Let F\mathbb{\mathbf{F}} be a free group. Let 1wF1\ne w\in\mathbb{\mathbf{F}} be a non-power, let σSd\sigma\in S_{d}, and suppose that

Γwση1Ση2Ση3Ω\Gamma_{w^{\sigma}}\xrightarrow{\eta_{1}}\Sigma\xrightarrow{\eta_{2}}\Sigma'\xrightarrow{\eta_{3}}\Omega

is an element of Decompalg3(wσF){\cal D}\mathrm{ecomp}_{\mathrm{alg}}^{3}(w^{\sigma}\to\mathbb{\mathbf{F}}) such that η1\eta_{1} is efficient, Σ\Sigma has a cycle as a connected component, Σ\Sigma' has none, and η2η1\eta_{2}\circ\eta_{1} is not efficient. Cycle/non-efficient contribution conjecture. Under these hypotheses,

Cη2alg(N)=O(Ndsπ(w)1).C_{\eta_{2}}^{\mathrm{alg}}(N)=O\left(N^{-d\mathrm{s\pi}(w)-1}\right).

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

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

No solutions have been posted yet.