r-Stable hypersimplices

Benjamin Braun, Liam Solus

Producción científica: Articlerevisión exhaustiva

3 Citas (Scopus)

Resumen

Hypersimplices are well-studied objects in combinatorics, optimization, and representation theory. For each hypersimplex, we define a new family of subpolytopes, called r-stable hypersimplices, and show that a well-known regular unimodular triangulation of the hypersimplex restricts to a triangulation of each r-stable hypersimplex. For the case of the second hypersimplex defined by the two-element subsets of an n-set, we provide a shelling of this triangulation that sequentially shells each r-stable sub-hypersimplex. In this case, we utilize the shelling to compute the Ehrhart h-polynomials of these polytopes, and the hypersimplex, via independence polynomials of graphs. For one such r-stable hypersimplex, this computation yields a connection to CR mappings of Lens spaces via Ehrhart–MacDonald reciprocity.

Idioma originalEnglish
Páginas (desde-hasta)349-388
Número de páginas40
PublicaciónJournal of Combinatorial Theory. Series A
Volumen157
DOI
EstadoPublished - jul 2018

Nota bibliográfica

Publisher Copyright:
© 2018 Elsevier Inc.

Financiación

Benjamin Braun was partially supported by the National Security Agency through awards H98230-13-1-0240 and H98230-16-1-0045. Liam Solus was partially supported by a 2014 National Science Foundation/Japan Society for the Promotion of Science East Asia and Pacific Summer Institute Fellowship (EAPSI award 1414621).

FinanciadoresNúmero del financiador
National Science Foundation Arctic Social Science Program1414621
National Security AgencyH98230-13-1-0240, H98230-16-1-0045

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Discrete Mathematics and Combinatorics
    • Computational Theory and Mathematics

    Huella

    Profundice en los temas de investigación de 'r-Stable hypersimplices'. En conjunto forman una huella única.

    Citar esto