Demazure characters, also known as key polynomials, generalize the classical Schur polynomials. In particular, when all variables are set equal to $1$, these polynomials count the number of integer points in a certain class of Gelfand--Tsetlin polytopes. This property highlights the interaction between the corresponding polyhedral and combinatorial structures via Ehrhart theory. In this paper, we give an overview of results concerning the interplay between the geometry of Gelfand-Tsetlin polytopes and their Ehrhart polynomials. Motivated by strong computer evidence, we propose several conjectures about the non-negativity of the coefficients of such polynomials.Comment: To appear in the conference proceedings of the Summer workshop on latt...
This thesis studies the properties of Demazure atoms and characters using linear operators and also ...
Nonsymmetric Macdonald polynomials are a polynomial generalization of their symmetric counterparts t...
17 pages, 2 figuresInternational audienceOne considers weighted sums over points of lattice polytope...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.Includes bibliogr...
In geometric, algebraic, and topological combinatorics, properties such as symmetry, unimodality, an...
ABSTRACT. The Ehrhart polynomial LP of an integral polytope P counts the number of integer points in...
In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version o...
International audienceThere are few general results about the coefficients of Ehrhart poly...
We study the equivariant Ehrhart theory of families of polytopes that are invariant under a non-triv...
Kohnert polynomials are polynomials indexed by unit cell diagrams in the first quadrant defined earl...
Abstract. Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in part...
In this paper, we give a formula for the number of lattice points in the dilations of Schubert matro...
A lattice polytope translated by a rational vector is called an almost integral polytope. In this pa...
This thesis studies the properties of Demazure atoms and characters using linear operators and also ...
The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice poi...
This thesis studies the properties of Demazure atoms and characters using linear operators and also ...
Nonsymmetric Macdonald polynomials are a polynomial generalization of their symmetric counterparts t...
17 pages, 2 figuresInternational audienceOne considers weighted sums over points of lattice polytope...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.Includes bibliogr...
In geometric, algebraic, and topological combinatorics, properties such as symmetry, unimodality, an...
ABSTRACT. The Ehrhart polynomial LP of an integral polytope P counts the number of integer points in...
In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version o...
International audienceThere are few general results about the coefficients of Ehrhart poly...
We study the equivariant Ehrhart theory of families of polytopes that are invariant under a non-triv...
Kohnert polynomials are polynomials indexed by unit cell diagrams in the first quadrant defined earl...
Abstract. Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in part...
In this paper, we give a formula for the number of lattice points in the dilations of Schubert matro...
A lattice polytope translated by a rational vector is called an almost integral polytope. In this pa...
This thesis studies the properties of Demazure atoms and characters using linear operators and also ...
The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice poi...
This thesis studies the properties of Demazure atoms and characters using linear operators and also ...
Nonsymmetric Macdonald polynomials are a polynomial generalization of their symmetric counterparts t...
17 pages, 2 figuresInternational audienceOne considers weighted sums over points of lattice polytope...