Counterexamples to the 0-1 conjecture
Abstract
For permutations x and w, let mu(x,w) be the coefficient of highest possible degree in the Kazhdan-Lusztig polynomial Px,w. It is well-known that the coefficients mu(x,w) arise as the edge labels of certain graphs encoding the representations of Sn. The 0-1 Conjecture states that the mu(x,w) are either 0 or 1. We present two counterexamples to this conjecture, the first in S16, for which x and w are in the same left cell, and the second in S10. The proof of the counterexample in S16 relies on computer calculations.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.