AbstractMotivated by representation theory and geometry, we introduce and develop an equivariant generalization of Ehrhart theory, the study of lattice points in dilations of lattice polytopes. We prove representation-theoretic analogues of numerous classical results, and give applications to the Ehrhart theory of rational polytopes and centrally symmetric polytopes. We also recover a character formula of Procesi, Dolgachev, Lunts and Stembridge for the action of a Weyl group on the cohomology of a toric variety associated to a root system
AbstractThe Ehrhart polynomial of an integral convex polytope counts the number of lattice points in...
Let P be a simple lattice polytope. We define an action of the Hecke operators on E(P), the Ehrhart ...
Abstract. The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dila...
This dissertation presents recent contributions to two major topics in discrete geometry: Ehrhart th...
Ehrhart theory concerns the enumeration of lattice points in a lattice polytope. More specically, to...
Ehrhart theory concerns the enumeration of lattice points in a lattice polytope. More specically, to...
The Ehrhart quasipolynomial of a rational polytope $\Pol$ encodes fundamental arithmetic data of $\P...
We study the equivariant Ehrhart theory of families of polytopes that are invariant under a non-triv...
A rational polytope is the convex hull of a finite set of points in R-d with rational coordinates. ...
A rational polytope is the convex hull of a finite set of points in R-d with rational coordinates. ...
A rational polytope is the convex hull of a finite set of points in Rd with rational coordinates. Gi...
A rational polytope is the convex hull of a finite set of points in R-d with rational coordinates. ...
AbstractIn an earlier paper (1999, Electron. J. Combin.6, R37), the author generalized Ehrhart's ide...
In the 1960s, Eugene Ehrhart developed Ehrhart theory to enumerate lattice points\ud in convex polyt...
Abstract. In [1], the author generalized Ehrhart’s idea ([2]) of counting lattice points in dilated ...
AbstractThe Ehrhart polynomial of an integral convex polytope counts the number of lattice points in...
Let P be a simple lattice polytope. We define an action of the Hecke operators on E(P), the Ehrhart ...
Abstract. The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dila...
This dissertation presents recent contributions to two major topics in discrete geometry: Ehrhart th...
Ehrhart theory concerns the enumeration of lattice points in a lattice polytope. More specically, to...
Ehrhart theory concerns the enumeration of lattice points in a lattice polytope. More specically, to...
The Ehrhart quasipolynomial of a rational polytope $\Pol$ encodes fundamental arithmetic data of $\P...
We study the equivariant Ehrhart theory of families of polytopes that are invariant under a non-triv...
A rational polytope is the convex hull of a finite set of points in R-d with rational coordinates. ...
A rational polytope is the convex hull of a finite set of points in R-d with rational coordinates. ...
A rational polytope is the convex hull of a finite set of points in Rd with rational coordinates. Gi...
A rational polytope is the convex hull of a finite set of points in R-d with rational coordinates. ...
AbstractIn an earlier paper (1999, Electron. J. Combin.6, R37), the author generalized Ehrhart's ide...
In the 1960s, Eugene Ehrhart developed Ehrhart theory to enumerate lattice points\ud in convex polyt...
Abstract. In [1], the author generalized Ehrhart’s idea ([2]) of counting lattice points in dilated ...
AbstractThe Ehrhart polynomial of an integral convex polytope counts the number of lattice points in...
Let P be a simple lattice polytope. We define an action of the Hecke operators on E(P), the Ehrhart ...
Abstract. The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dila...