Related papers: Supersymmetric Schur polynomials have saturated Ne…

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):…

Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We…

Rado's theorem about permutahedra and dominance order on partitions reveals that each Schur polynomial is M-convex, or equivalently, it has a saturated Newton polytope and this polytope is a generalized permutahedron as well. In this paper…

We prove that double Schubert polynomials have the Saturated Newton Polytope property. This settles a conjecture by Monical, Tokcan and Yong. Our ideas are motivated by the theory of multidegrees. We introduce a notion of standardization of…

We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.

We prove that supports of non-symmetric Macdonald polynomials are $M$-convex. As a consequence, we resolve a 2019 conjecture of Monical, Tokcan, and Yong that they have the saturated Newton polytope property. As a corollary we show that…

The M-convexity of dual Schubert polynomials was first proven by Huh, Matherne, M\'esz\'aros, and St. Dizier in 2022. We give a full characterization of the supports of dual Schubert polynomials, which yields an elementary alternative proof…

Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent…

We study the Kronecker product of two Schur functions $s_\lambda\ast s_\mu$, defined as the image of the characteristic map of the product of two $S_n$ irreducible characters. We prove special cases of a conjecture of Monical--Tokcan--Yong…

The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…

D. Grigoriev-G. Koshevoy recently proved that tropical Schur polynomials have (at worst) polynomial tropical semiring complexity. They also conjectured tropical skew Schur polynomials have at least exponential complexity; we establish a…

We provide a framework for which one can approach showing the integer decomposition property for symmetric polytopes. We utilize this framework to prove a special case which we refer to as $2$-partition maximal polytopes in the case where…

The symmetric Grothendieck polynomials generalize Schur polynomials and are Schur-positive by degree. Combinatorially this is manifested as the generalization of semistandard Young tableaux by set-valued tableaux. We define a (weak)…

To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…

Let $s_\nu \circ s_\mu$ denote the plethystic product of the Schur functions $s_\nu$ and $s_\mu$. In this article we define an explicit polynomial representation corresponding to $s_\nu \circ s_\mu$ with basis indexed by certain…

A Banach space is {\it polynomially Schur} if sequential convergence against analytic polynomials implies norm convergence. Carne, Cole and Gamelin show that a space has this property and the Dunford-Pettis property if and only if it is…

We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…

This paper proposes a squared smoothing Newton method via the Huber smoothing function for solving semidefinite programming problems (SDPs). We first study the fundamental properties of the matrix-valued mapping defined upon the Huber…

When $\lambda$ is a partition, the specialized non-symmetric Macdonald polynomial $E_{\lambda}(x;q;0)$ is symmetric and related to a modified Hall--Littlewood polynomial. We show that whenever all parts of the integer partition $\lambda$ is…

Thom polynomials provide universal formulas for the fundamental class of singularity loci in terms of characteristic classes. Ohmoto extended this notion to SSM-Thom polynomials, which refine this description by capturing the richer…