The stable square-length asymptotic formula for orthogonal characters
The stable square-length asymptotic formula for orthogonal characters
Let , let be a partition, and let be the number of stable-square-length-extremal surfaces, orientable or non-orientable, with non-oriented boundary components corresponding to , modulo the equivalence specified in the source. Let be a partition, let be the corresponding stable irreducible character of , and let be the coefficient of in its power-sum expansion. Orthogonal stable square-length conjecture. For every partition ,
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.
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
Doron Puder, Yotam Shomroni, Danielle Ernst-West and Matan Seidel, “Stable Invariants of Words from Random Matrices”, arXiv:2311.17733 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.