Related papers: Ehrhart series and lattice triangulations

We enumerate smooth rational curves on very general Weierstrass fibrations over hypersurfaces in projective space. The generating functions for these numbers lie in the ring of classical modular forms. The method of proof uses topological…

A lattice polytope is "free" (or "empty") if its vertices are the only lattice points it contains. In the context of valuation theory, Klain (1999) proposed to study the functions $\alpha_i(P;n)$ that count the number of free polytopes in…

We introduce the notion of rationality for hyperholomorphic functions (functions in the kernel of the Cauchy-Fueter operator). Following the case of one complex variable, we give three equivalent definitions: the first in terms of…

Let (S,H) be a rational algebraic surface with an ample divisor. We compute generating functions for the Hodge numbers of the moduli spaces of H-stable rank 2 sheaves on S in terms of certain theta functions for indefinite lattices that…

In a previous paper, we showed how to use the Ehrhart function $L_P(s)$, defined by $L_P(s) = \#(sP \cap \mathbb Z^d)$, to reconstruct a polytope $P$. More specifically, we showed that, for rational polytopes $P$ and $Q$, if $L_{P + w}(s) =…

My main results are simple formulas for the surface area of d-dimensional lattice polytopes using Ehrhart theory.

The coefficients of the local $h$-polynomial of the barycentric subdivision of the simplex with $n$ vertices are known to count derangements in the symmetric group $\mathfrak{S}_n$ by the number of excedances. A generalization of this…

Horizontal and vertical generating functions and recursion relations have been investigated by Comtet for triangular double sequences. In this paper we investigate the horizontal and vertical log-concavity of triangular sequences assigned…

Some of the classical orthogonal polynomials such as Hermite, Laguerre, Charlier, etc. have been shown to be the generating polynomials for certain combinatorial objects. These combinatorial interpretations are used to prove new identities…

For a fixed dimension $N$ we compute the generating function of the numbers $t_N(n)$ (respectively $\bar{t}_N(n)$) of $PGL_{N+1}(k)$-orbits of rational $n$-sets (respectively rational $n$-multisets) of the projective space $\mathb{P}^N$…

The local $h^*$-polynomial of a lattice polytope is an important invariant arising in Ehrhart theory. Our focus is on lattice simplices presented in Hermite normal form with a single non-trivial row. We prove that when the off-diagonal…

The Ehrhart polynomial of a lattice polygon P is completely determined by the pair (b(P),i(P)) where b(P) equals the number of lattice points on the boundary and i(P) equals the number of interior lattice points. All possible pairs…

Let G be a connected reductive algebraic group and H be a reductive closed and connected subgroup of G both defined on an algebraically closed field of characteristic zero. We consider the set C of the couple (x,y) of the dominant weights…

This paper gives an explicit formula for the Ehrhart quasi-polynomial of certain 2-dimensional polyhedra in terms of invariants of surface quotient singularities. Also, a formula for the dimension of the space of quasi-homogeneous…

We consider semisimple triangular operators acting in the symmetric component of the group algebra over the weight lattice of a root system. We present a determinantal formula for the eigenbasis of such triangular operators. This…

We study higher-dimensional analogs of the Dedekind-Carlitz polynomials c(u,v;a,b) := sum_{k=1..b-1} u^[ka/b] v^(k-1), where u and v are indeterminates and a and b are positive integers. Carlitz proved that these polynomials satisfy the…

We give a cohomological and geometrical interpretation for the weighted Ehrhart theory of a full-dimensional lattice polytope $P$, with Laurent polynomial weights of geometric origin. For this purpose, we calculate the motivic Chern and…

We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…

This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…

We discuss and give elementary proofs of results of Brion and of Lawrence-Varchenko on the lattice-point enumerator generating functions for polytopes and cones. This largely expository note contains a new proof of Brion's Formula using…