Supersymmetric Schur polynomials have saturated Newton polytopes

Abstract

We prove that every supersymmetric Schur polynomial has a saturated Newton polytope (SNP). Our approach begins with a tableau-theoretic description of the support, which we encode as a polyhedron with a totally unimodular constraint matrix. The integrality of this polyhedron follows from the Hoffman-Kruskal criterion, thereby establishing the SNP property.