Supersymmetric Schur polynomials have saturated Newton polytopes
Combinatorics
2025-08-21 v2 Representation Theory
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.
Cite
@article{arxiv.2507.22528,
title = {Supersymmetric Schur polynomials have saturated Newton polytopes},
author = {Dang Tuan Hiep and Khai-Hoan Nguyen-Dang},
journal= {arXiv preprint arXiv:2507.22528},
year = {2025}
}
Comments
13 pages, 3 figures, add references, change abstract