The stable square-length asymptotic formula for orthogonal characters

About 3 years old · traced to

Let 1≠w∈F1\ne w\in\mathbb{\mathbf{F}}, let μ=(μ1,…,μk)\mu=(\mu_{1},\ldots,\mu_{k}) be a partition, and let ew,μe_{w,\mu} be the number of stable-square-length-extremal surfaces, orientable or non-orientable, with non-oriented boundary components corresponding to wμ1,…,wμkw^{\mu_{1}},\ldots,w^{\mu_{k}}, modulo the equivalence specified in the source. Let ν\nu be a partition, let ψν[N]\psi^{\nu[N]} be the corresponding stable irreducible character of O(N)\mathrm{O}(N), and let bν,μb_{\nu,\mu} be the coefficient of ζμ\zeta_{\mu} in its power-sum expansion. Orthogonal stable square-length conjecture. For every partition ν\nu,

Ew[ψν[N]]=N−∣ν∣ssql(w)((∑μ⊢∣ν∣bν,μew,μ)+O(N−1)).\mathbb{E}_{w}\left[\psi^{\nu[N]}\right]=N^{-\lvert\nu\rvert\mathrm{ssql}(w)}\left(\left(\sum_{\mu\vdash\lvert\nu\rvert}b_{\nu,\mu}e_{w,\mu}\right)+O(N^{-1})\right).

The conjecture extends the stable square-length asymptotic picture to orthogonal groups, where the relevant extremal surfaces may be non-orientable; the source notes exact surface formulas for power sums but does not prove this character formula.

References

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.