Kirillov's saturation conjecture for Schubert coefficients
Kirillov's saturation conjecture for Schubert coefficients
For permutations , let be the Schubert coefficients defined by
For , write its Lehmer code as , and define code scaling by
Kirillov's conjecture. For every and every integer ,
This conjecture proposes that positivity of Schubert coefficients is preserved exactly under code scaling, generalizing the saturation theorem for Littlewood–Richardson coefficients. The source states that it remained open until the paper in which this conjecture appears; no resolution is supplied in the provided material.
Sources & referencesView supporting material
Primary source
Igor Pak and Colleen Robichaux, “Saturation property fails for Schubert coefficients”, arXiv:2601.04182 (2026).
Progress summary
A 2026 paper gives explicit examples showing that Kirillov’s proposed preservation rule is false.
Kirillov formulated the conjecture in 2004: scaling the Lehmer codes of three permutations should preserve positivity of the corresponding Schubert coefficient. The conjecture is false, already in four-dimensional permutation examples.
2026 counterexamples
The paper constructs, for every , permutations with but for every ; its smallest example is , , . A later paper independently records these counterexamples and states that the stretched coefficients are eventually quasi-polynomial. The revised counterexample paper also reports that its first author and Slonim refuted the opposite implication, so both directions of the proposed equivalence fail. The analogous -step saturation question remains open.
Current status (as of August 2026): Kirillov’s conjecture is settled negatively; explicit counterexamples disprove the forward implication, and the revised paper reports that the reverse implication also fails.
Sources
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.