2000 character limit reached
The $h^*$-polynomials of type C hypersimplices
Published 4 Apr 2025 in math.CO | (2504.03898v1)
Abstract: We study the Ehrhart theory of hypersimplices of type C, as introduced by Lam and Postnikov for general crystallographic root systems. The $h*$-polynomials of classical hypersimplices are known to relate to various Eulerian statistics on the symmetric group. In this paper, we introduce a new statistic and partial order on signed permutations, which we use to derive explicit formulas for the $h*$-polynomials of type C hypersimplices. Additionally, we explore connections with other statistics, including flag-excedances and circular descents, flag-descents, and Coxeter descents.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.