← All problems

Makhija’s conjecture on products of elementary symmetric polynomials

For every permutation w∈Snw\in S_n, the Schubert polynomial Sw\mathfrak{S}_w can be written as a product of elementary symmetric polynomials in initial alphabets, Sw=∏t=1rebt(x1,…,xat)\mathfrak{S}_w=\prod_{t=1}^{r}e_{b_t}(x_1,\ldots,x_{a_t}) for some r≥0r\ge 0 and integers 1≤bt≤at1\le b_t\le a_t, if and only if ww avoids the four classical patterns 14321432, 14231423, 41324132, and 31423142. Here the empty product is allowed when Sw=1\mathfrak{S}_w=1.

References

Source: arXiv

Progress summary

Refreshed
Open

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 14321432, 14231423, 41324132, and 31423142. The proposed factorization is Sw=∏t=1rebt(x1,…,xat)\mathfrak{S}_w=\prod_{t=1}^{r}e_{b_t}(x_1,\dots,x_{a_t}).

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.