English

Shellability, Ehrhart Theory, and $r$-stable Hypersimplices

Combinatorics 2016-03-17 v3

Abstract

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.

Keywords

Cite

@article{arxiv.1408.4713,
  title  = {Shellability, Ehrhart Theory, and $r$-stable Hypersimplices},
  author = {Benjamin Braun and Liam Solus},
  journal= {arXiv preprint arXiv:1408.4713},
  year   = {2016}
}

Comments

35 pages, 23 figures

R2 v1 2026-06-22T05:34:55.025Z