TY - JOUR

T1 - Newton polytopes in algebraic combinatorics

AU - Monical, Cara

AU - Tokcan, Neriman

AU - Yong, Alexander

N1 - Funding Information:
We thank Alexander Barvinok, Laura Escobar, Sergey Fomin, Allen Knutson, Melinda Lanius, Fu Liu, Mark Shimozono, John Stembridge, Sue Tolman and Anna Weigandt for very helpful conversations. We thank Bruce Reznick specifically for his example of f = x 1 2 + x 2 x 3 + ⋯ \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f=x_1^2+x_2 x_3+\cdots $$\end{document} we used in the introduction. AY was supported by an NSF grant. CM and NT were supported by UIUC Campus Research Board Grants. We made significant use of SAGE during our investigations.
Publisher Copyright:
© 2019, Springer Nature Switzerland AG.

PY - 2019/12/1

Y1 - 2019/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85073513949&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85073513949&partnerID=8YFLogxK

U2 - 10.1007/s00029-019-0513-8

DO - 10.1007/s00029-019-0513-8

M3 - Article

AN - SCOPUS:85073513949

VL - 25

JO - Selecta Mathematica, New Series

JF - Selecta Mathematica, New Series

SN - 1022-1824

IS - 5

M1 - 66

ER -