Makhija’s conjecture on products of elementary symmetric polynomials
For every permutation , the Schubert polynomial can be written as a product of elementary symmetric polynomials in initial alphabets, for some and integers , if and only if avoids the four classical patterns , , , and . Here the empty product is allowed when .
References
- Factorizations by column blocks and Schubert polynomials as products of key polynomials — arXiv — Xuanying Han, Shunli Ma, Sophie C. C. Sun
Source: arXiv
Progress summary
A 2025 paper proves one direction of the conjecture and some obstructions, but the full factorization criterion remains unproved.
Oma Makhija’s 2025 preprint conjectures that a Schubert polynomial factors into elementary symmetric polynomials exactly when its permutation avoids , , , and . The proposed factorization is .
Known results
- Makhija, 2025: avoidance of all four patterns implies the stated factorization.
- Makhija, 2025: a rectangular cross-block in the bottom pipe dream obstructs such a factorization, giving partial progress toward the converse.
- Makhija, 2025: the proof of the forward direction uses Lehmer-code growth and pipe-dream column separation.
Current status (as of October 2026): The conjecture remains open; one implication and some converse obstructions are established, but no verified complete proof or counterexample is recorded.
Sources
Solutions 0
No solutions have been posted yet.