Lattice polytopes from schur and symmetric grothendieck polynomials

Margaret Bayer, Bennet Goeckner, Su Ji Hong, Tyrrell McAllister, McCabe Olsen, Casey Pinckney, Julianne Vega, Martha Yip

Producción científica: Articlerevisión exhaustiva

3 Citas (Scopus)

Resumen

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 interest, the confluence of these properties is a source of active investigation due to conjectures regarding the unimodality of the h-polynomial. In this paper, we consider the Newton polytopes arising from two families of polynomials in algebraic combinatorics: Schur polynomials and inflated symmetric Grothendieck polynomi-als. In both cases, we prove that these polytopes have the integer decomposition property by using the fact that both families of polynomials have saturated Newton polytope. Furthermore, in both cases, we provide a complete characterization of when these polytopes are reflexive. We conclude with some explicit formulas and unimodality implications of the h-vector in the case of Schur polynomials.

Idioma originalEnglish
Número de artículoP2.45
PublicaciónElectronic Journal of Combinatorics
Volumen28
N.º2
DOI
EstadoPublished - 2021

Nota bibliográfica

Publisher Copyright:
© The authors.

Financiación

This work was completed in part at the 2019 Graduate Research Workshop in Combinatorics, which was supported in part by NSF grant #1923238, NSA grant #H98230-18-1-0017, a generous award from the Combinatorics Foundation, and Simons Foundation Collaboration Grants #426971 (to M. Ferrara) and #315347 (to J. Martin). Partially supported by University of Kansas General Research Fund. Partially supported by AMS-Simons Travel Grant. Partially supported by Simons Collaboration Grant. The authors would like to thank Federico Castillo and Semin Yoo for helpful discussions and contributions to the early stages of the project. We would also like to thank Michel Marcus and Avery St. Dizier for helpful comments on a previous version of the paper. This work was completed in part at the 2019 Graduate Research Workshop in Combinatorics, which was supported in part by NSF grant #1923238, NSA grant #H98230-18-1-0017, a generous award from the Combinatorics Foundation, and Simons Foundation Collaboration Grants #426971 (to M. Ferrara) and #315347 (to J. Martin). \u2217Partially supported by University of Kansas General Research Fund. \u2020Partially supported by AMS-Simons Travel Grant. \u2021Partially supported by Simons Collaboration Grant.

FinanciadoresNúmero del financiador
Combinatorics Foundation
AMS-Simons
University of Kansas and University of Kansas Cancer Center
U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China1923238
National Security Agency98230-18-1-0017
Simons Foundation426971, 315347

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Geometry and Topology
    • Discrete Mathematics and Combinatorics
    • Computational Theory and Mathematics
    • Applied Mathematics

    Huella

    Profundice en los temas de investigación de 'Lattice polytopes from schur and symmetric grothendieck polynomials'. En conjunto forman una huella única.

    Citar esto