← All papers
First page of Webs and exponentially large mu-coefficients

Webs and exponentially large mu-coefficients

Tom Goertzen, Abel Lacabanne, Daniel Tubbenhauer, Pedro Vaz

math.RT Oct 26, 2026 · v2 math.CO math.QA
Lean formalization verifies the local tensor and web diagram calculations, the lattice induction, and the two-state readout for every block count; code is in a public repository.
Using webs, we prove that Kazhdan-Lusztig mu-coefficients for symmetric groups grow at least exponentially with the rank, already for pairs labeled by a three-row rectangle.

Whether Kazhdan–Lusztig mu-coefficients for symmetric groups are bounded had been open for over two decades, after the 0/1 conjecture was disproved in 2002.

Pairs of permutations labeled by three-row rectangular tableaux are encoded as sl3 webs. Via the FKK identification, mu(x,y) becomes a tensor coordinate of a dual canonical basis vector. That vector is built from repeated planar web blocks with corrections on a fixed 28-dimensional connecting space, and dual canonicality is proved by local degree bounds. Extracting the coefficient then reduces to a two-state matrix calculation, and the computations are verified in Lean.

For the family x_{2r}, y_{2r} in S_{12+18r}, mu(x_{2r},y_{2r}) = 2^r. Mu-coefficients therefore grow at least exponentially in the rank, which settles boundedness in all classical finite types and gives the same growth in their affine counterparts.

r0123
symmetric groupS_12S_30S_48S_66
cell shape(4,4,4)(10,10,10)(16,16,16)(22,22,22)
mu1248
mu-coefficients for the exponential family