The stable square-length asymptotic formula for unitary characters
The stable square-length asymptotic formula for unitary characters
Let , let be an integer sequence with no zero entries, and let be the number of orientable stable-square-length-extremal surfaces with oriented boundary components corresponding to , modulo the equivalence specified in the source. Let be a pair of partitions, let be the corresponding stable irreducible character of , and let be the coefficient of in its power-sum expansion. Unitary stable square-length conjecture. For every such , and ,
The conjecture refines the proposed role of stable square length for arbitrary stable unitary representations by identifying the leading coefficient with extremal orientable surfaces. The source presents this as conjectural despite related exact surface expansions for power sums.
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.