English
Related papers

Related papers: Ehrhart positivity and Demazure characters

200 papers

We examine the non-symmetric Macdonald polynomials $E_\lambda(x;q,t)$ at $q=1$, as well as the more general permuted-basement Macdonald polynomials. When $q=1$, we show that $E_\lambda(x;1,t)$ is symmetric and independent of $t$ whenever…

Combinatorics · Mathematics 2019-07-02 Per Alexandersson , Mehtaab Sawhney

Ehrhart's famous theorem states that the number of integral points in a rational polytope is a quasi-polynomial in the integral dilation factor. We study the case of rational dilation factors and it turns out that the number of integral…

Combinatorics · Mathematics 2011-03-04 Eva Linke

For a given lattice polytope, two fundamental problems within the field of Ehrhart theory are to (1) determine if its (Ehrhart) $h^\ast$-polynomial is unimodal and (2) to determine if its Ehrhart polynomial has only positive coefficients.…

Combinatorics · Mathematics 2018-04-24 Fu Liu , Liam Solus

It is shown that, for each $d \geq 4$, there exists an integral convex polytope $\mathcal{P}$ of dimension $d$ such that each of the coefficients of $n, n^{2}, \ldots, n^{d-2}$ of its Ehrhart polynomial $i(\mathcal{P},n)$ is negative.…

Combinatorics · Mathematics 2016-05-03 Takayuki Hibi , Akihiro Higashitani , Akiyoshi Tsuchiya , Koutarou Yoshida

In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart…

Combinatorics · Mathematics 2019-12-24 Sam Hopkins , Alexander Postnikov

We consider the Ehrhart polynomial of hypersimplices. It is proved that these polynomials have positive coefficients and we give a combinatorial formula for each of them. This settles a problem posed by Stanley and also proves that uniform…

Combinatorics · Mathematics 2020-11-23 Luis Ferroni

For $\ba \in \R_{\geq 0}^{n}$, the Tesler polytope $\tes_{n}(\ba)$ is the set of upper triangular matrices with non-negative entries whose hook sum vector is $\ba$. Motivated by a conjecture of Morales', we study the questions of whether…

Combinatorics · Mathematics 2021-02-19 Yonggyu Lee , Fu Liu

We show that the linear coefficient of the Ehrhart polynomial of a matroid base polytope evaluated at $t-1$ is equal to, up to normalization, the $\beta$-invariant of the matroid. This yields a lattice-point counting formula for the…

It was observed by Bump et al. that Ehrhart polynomials in a special family exhibit properties similar to the Riemann {\zeta} function. The construction was generalized by Matsui et al. to a larger family of reflexive polytopes coming from…

Combinatorics · Mathematics 2018-04-20 Akihiro Higashitani , Mario Kummer , Mateusz Michałek

In this expository article we give an introduction to Ehrhart theory, i.e., the theory of integer points in polyhedra, and take a tour through its applications in enumerative combinatorics. Topics include geometric modeling in…

Combinatorics · Mathematics 2014-07-23 Felix Breuer

A generic orthotope is an orthogonal polytope whose tangent cones are described by read-once Boolean functions. The purpose of this note is to develop a theory ofEhrhart polynomials for integral generic orthotopes. The most remarkable part…

Combinatorics · Mathematics 2023-09-19 David Richter

This paper studies the properties of Demazure atoms and characters using linear operators and also tableaux-combinatorics. It proves the atom-positivity property of the product of a dominating monomial and an atom, which was an open…

Combinatorics · Mathematics 2016-06-09 Anna Ying Pun

A positroid is a matroid realized by a matrix such that all maximal minors are non-negative. Positroid polytopes are matroid polytopes of positroids. In particular, they are lattice polytopes. The Ehrhart polynomial of a lattice polytope…

Combinatorics · Mathematics 2025-01-20 Yuhan Jiang

We give an explicit, nonnegative formula for the expansion of nonsymmetric Macdonald polynomials specialized at $t=0$ in terms of Demazure characters. Our formula results from constructing Demazure crystals whose characters are the…

Combinatorics · Mathematics 2019-02-22 Sami Assaf , Nicolle Gonzalez

We generalize a theorem of Littlewood concerning the factorization of Schur polynomials when their variables are twisted by roots of unity. We show that a certain family of flagged skew Schur polynomials admit a similar factorization. These…

Combinatorics · Mathematics 2023-06-21 V. Sathish Kumar

Using the action of the Yang-Baxter elements of the Hecke algebra on polynomials, we define two bases of polynomials in n variables. The Hall-Littlewood polynomials are a subfamily of one of them. For q=0, these bases specialize into the…

Combinatorics · Mathematics 2007-05-23 Francois Descouens , Alain Lascoux

This article considers some q-analogues of classical results concerning the Ehrhart polynomials of Gorenstein polytopes, namely properties of their q-Ehrhart polynomial with respect to a good linear form. Another theme is a specific linear…

Quantum Algebra · Mathematics 2014-08-07 Frédéric Chapoton , Driss Essouabri

It is known that the Ehrhart polynomials of cross-polytopes, as well as of pyramids over them, have positive coefficients. We give a combinatorial proof of this fact by showing that a scaled version of the Ehrhart polynomials are generating…

Combinatorics · Mathematics 2025-12-10 Krishna Menon , Emil Verkama

Stanley symmetric functions are the stable limits of Schubert polynomials. In this paper, we show that, conversely, Schubert polynomials are Demazure truncations of Stanley symmetric functions. This parallels the relationship between Schur…

Combinatorics · Mathematics 2018-09-14 Sami Assaf , Anne Schilling

The Schur function indexed by a partition lambda with at most n parts is the sum of the weight monomials for the Young tableaux of shape lambda. Let pi be an n-permutation. We give two descriptions of the tableaux that contribute their…

Combinatorics · Mathematics 2017-07-11 Robert A. Proctor , Matthew J. Willis