Newton polytopes in algebraic combinatorics

• Cara Monical ^[1] ; Neriman Tokcan ^[1] ; Alexander Yong ^[1]
  1. [1] University of Illinois, USA
• Localización: Selecta Mathematica, New Series, ISSN 1022-1824, Vol. 25, Nº. 5, 2019
• Idioma: inglés
• DOI: 10.1007/s00029-019-0513-8
• Enlaces
  • Texto completo
• Resumen

  • A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally): skew Schur polynomials; symmetric polynomials associated to reduced words, Redfield–Pólya theory, Witt vectors, and totally nonnegative matrices; resultants; discriminants (up to quartics); Macdonald polynomials; key polynomials; Demazure atoms; Schubert polynomials; and Grothendieck polynomials, among others. Our principal construction is the Schubitope. For any subset of [n]2, we describe it by linear inequalities. This generalized permutahedron conjecturally has positive Ehrhart polynomial. We conjecture it describes the Newton polytope of Schubert and key polynomials. We also define dominance order on permutations and study its poset-theoretic properties.