Vertex characterization conjecture for key-polynomial Newton polytopes

About 9 years old · traced to

For compositions γ\gamma and α\alpha, write γ⪯α\gamma\preceq\alpha when λ(γ)=λ(α)\lambda(\gamma)=\lambda(\alpha) and w(γ)≤w(α)w(\gamma)\leq w(\alpha) in Bruhat order, where λ(γ)\lambda(\gamma) is obtained by sorting the parts and w(γ)w(\gamma) is the shortest permutation sending λ(γ)\lambda(\gamma) to γ\gamma. The paper proves that β⪯α\beta\preceq\alpha implies that β\beta is a vertex of Newton(κα){\sf Newton}(\kappa_\alpha). Vertex characterization conjecture. Conversely, every vertex of Newton(κα){\sf Newton}(\kappa_\alpha) satisfies β⪯α\beta\preceq\alpha. This remains open in the source.

References

Primary source

Cara Monical, Neriman Tokcan and Alexander Yong, “Newton Polytopes in Algebraic Combinatorics”, arXiv:1703.02583 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.