Euler Maclaurin formulas for a polytope express the sum of the values of a function over the lattice points in the polytope in terms of integrals of the function and its derivatives over faces of the polytope or its expansions. Exact Euler Maclaurin formulas [Khovanskii-Pukhlikov, Cappell-Shaneson, Guillemin, Brion-Vergne] apply to exponential or polynomial functions; Euler Maclaurin formulas with remainder [Karshon-Sternberg-Weitsman] apply to more general smooth functions.
In this paper we review these results and present proofs of the exact formulas obtained by these authors, using elementary methods. We then use an algebraic formalism due to Cappell and Shaneson to relate the different formulas.
We use a version of localization in equivariant cohomology for the norm-square of the moment map, described by Paradan, to give several weighted decompositions for simple polytopes. As an application, we study Euler-Maclaurin formulas.
We give an Euler Maclaurin formula with remainder for the sum of the values of a smooth function on the integral points in a simple integral polytope. This formula is proved by elementary methods.
An asymptotic expansion formula of Riemann sums over lattice polytopes is given. The formula is an asymptotic form of the local Euler-Maclaurin formula due to Berline-Vergne. The proof given here for Delzant lattice polytopes is independent of the local Euler-Maclaurin formula. But we use it for general lattice polytopes. As corollaries, an explicit formula for each term in the expansion over Delzant polytopes in two dimension and an explicit formula for the third term of the expansion for Delzant polytopes in arbitrary dimension are given. Moreover, some uniqueness results are given.
We give an Euler-Maclaurin formula with remainder for the weighted sum of the values of a smooth function on the integral points in a simple integral polytope. Our work generalizes the formula obtained by Karshon, Sternberg and Weitsman in the ''Euler-Maclaurin with remainder for a simple integral polytope''.
We extend to Barvinok's valuations the Euler-Maclaurin expansion formula which we obtained previously for the sum of values of a polynomial over the integral points of a rational polytope. This leads to an improvement of Barvinok's polynomial type algorithm for computing the highest coefficients of the corresponding Ehrhart quasi-polynomial.
A local lattice point counting formula, and more generally a local Euler-Maclaurin formula follow by comparing two natural families of meromorphic functions on the dual of a rational vector space $V$, namely the family of exponential sums (S) and the family of exponential integrals (I) parametrized by the set of rational polytopes in $V$. The paper introduces the notion of an interpolator between these two families of meromorphic functions. We prove that every rigid complement map in $V$ gives rise to an effectively computable \SI-interpolator (and a local Euler-MacLaurin formula), an \IS-inte…
We give a local Euler-Maclaurin formula for rational convex polytopes in a rational euclidean space . For every affine rational polyhedral cone C in a rational euclidean space W, we construct a differential operator of infinite order D(C) on W with constant rational coefficients, which is unchanged when C is translated by an integral vector. Then for every convex rational polytope P in a rational euclidean space V and every polynomial function f (x) on V, the sum of the values of f(x) at the integral points of P is equal to the sum, for all faces F of P, of the integral over F of the function …
We discuss two theorems in analytic number theory and combinatory analysis that have seen increased use in recent years. A corollary to a Tauberian theorem of Ingham allows one to quickly prove asymptotic formulas for arithmetic sequences, so long as the corresponding generating function exhibits exponential growth of a certain form near its radius of convergence. Two common methods for proving the required analytic behavior are modular transformations and Euler-Maclaurin summation. However, these results are sometimes stated without certain technical conditions that are necessary for the comp…
Given a finite set of vectors spanning a lattice and lying in a halfspace of a real vector space, to each vector $a$ in this vector space one can associate a polytope consisting of nonnegative linear combinations of the vectors in the set which sum up to $a$. This polytope is called the partition polytope of $a$. If $a$ is integral, this polytope contains a finite set of lattice points corresponding to nonnegative integral linear combinations. The partition polytope associated to an integral $a$ is a rational convex polytope, and any rational convex polytope can be realized canonically as a pa…
We show that the Euler-MacLaurin formula for Riemann sums has an n-dimensional analogue in which intervals on the line get replaced by convex polytopes.
We equip the space of lattice cones with a coproduct which makes it a connected cograded colagebra. The exponential sum and exponential integral on lattice cones can be viewed as linear maps on this space with values in the space of meromorphic germs with linear poles at zero. We investigate the subdivision properties-- reminiscent of the inclusion-exclusion principle for the cardinal on finite sets-- of such linear maps and establish a compatibility of these properties with respect to the convolution quotient of the coalgebra. Implementing the Algebraic Birkhoff Factorization procedure on the…
The Euler-MacLaurin summation formula relates a sum of a function to a corresponding integral, with a remainder term. The remainder term has an asymptotic expansion, and for a typical analytic function, it is a divergent (Gevrey-1) series. Under some decay assumptions of the function in a half-plane (resp. in the vertical strip containing the summation interval), Hardy (resp. Abel-Plana) prove that the asymptotic expansion is a Borel summable series, and give an exact Euler-MacLaurin summation formula. Using a mild resurgence hypothesis for the function to be summed, we give a Borel summable t…
Consider the Riemann sum of a smooth compactly supported function h(x) on a polyhedron in R^d, sampled at the points of the lattice Z^d/t. We give an asymptotic expansion when t goes to infinity, writing each coefficient of this expansion as a sum indexed by the faces f of the polyhedron, where the f-term is the integral over f of a differential operator applied to the function h(x). In particular, if a Euclidean scalar product is chosen, we prove that the differential operator for the face f can be chosen (in a unique way) to involve only normal derivatives to f. Our formulas are valid for a …
This paper presents an algebraic construction of Euler-Maclaurin formulas for polytopes. The formulas obtained generalize and unite the previous lattice point formulas of Morelli and Pommersheim-Thomas, and the Euler-Maclaurin formulas of Berline-Vergne While the approach of this paper originates in the theory of toric varieties, and recovers previous results about characteristic classes of toric varieties, the present paper is self-contained and does not rely on results from toric geometry. We aim in particular to exhibit in a combinatorial way ingredients such as such Todd classes and cycle-…
An extension of the theory of the Iterated Logarithmic Algebra gives the logarithmic analog of a Sheffer or Appell sequence of polynomials. This leads to several examples including Stirling's formula and a logarithmic version of the Euler-MacLaurin summation formula. Grâce à une généralisation de la théorie de l'algèbre des logarithmes itérés, on definit un analogue logarithmique des suites de polynômes de Sheffer et d'Appell. Quelques exemples d'applications permettent de déduire la formule de Stirling ainsi qu'un version logarithmique de la formule de sommation de Euler--MacLaurin.
According to Euler's relation any polytope P has as many faces of even dimension as it has faces of odd dimension. As a generalization of this fact one can compare the number of faces whose dimension is congruent to i modulo m with the number of all faces of P for some positive integer m and for some 0 < i < m+1. We show some classes of polytopes for which the above proportion is asymptotically equal to 1/m.
Let $V$ be a real vector space of dimension $n$ and let $M\subset V$ be a lattice. Let $P\subset V$ be an $n$-dimensional polytope with vertices in $M$, and let $φ\colon V\rightarrow \CC $ be a homogeneous polynomial function of degree $d$ (i.e., an element of $\Sym^{d} (V^{*})$). For $q\in \ZZ_{>0}$ and any face $F$ of $P$, let $D_{φ,F} (q)$ be the sum of $φ$ over the lattice points in the dilate $qF$. We define a generating function $G_φ(q,y) \in \QQ [q] [y]$ packaging together the various $D_{φ,F} (q)$, and show that it satisfies a functional equation that simultaneously generalizes Ehrhart…
"V - E + F = 2", the famous Euler's polyhedral formula, has a natural generalization to convex polytopes in every finite dimension, also known as the Euler-Poincaré Formula. We provide another short inductive proof of the general formula. Our proof is self-contained and it does not use shellability of polytopes.
A lattice polytope $\mathcal{P}$ is called reflexive if its dual $\mathcal{P}^\vee$ is a lattice polytope. The property that $\mathcal{P}$ is unimodularly equivalent to $\mathcal{P}^\vee$ does not hold in general, and in fact there are few examples of such polytopes. In this note, we introduce a new reflexive simplex $Q_n$ which has this property. Additionally, we show that $δ$-polynomalial of $Q_n$ is the Eulerian polynomial and show the existence of a regular, flag, unimodular triangulation.
We describe and analyze a new construction that produces new Eulerian lattices from old ones. It specializes to a construction that produces new strongly regular cellular spheres (whose face lattices are Eulerian). The construction does not always specialize to convex polytopes; however, in a number of cases where we can realize it, it produces interesting classes of polytopes. Thus we produce an infinite family of rational 2-simplicial 2-simple 4-polytopes, as requested by Eppstein, Kuperberg and Ziegler. We also construct for each $d\ge3$ an infinite family of $(d-2)$-simplicial 2-simple $d$…
We will study the angle sums of polytopes, listed in the $α$-vector, working to exploit the analogy between the f-vector of faces in each dimension and the alpha-vector of angle sums. The Gram and Perles relations on the $α$-vector are analogous to the Euler and Dehn-Sommerville relations on the f-vector. First we describe the spaces spanned by the the alpha-vector and the $α$-f-vectors of certain classes of polytopes. Families of polytopes are constructed whose angle sums span the spaces of polytopes defined by the Gram and Perles equations. This shows that the dimension of the affine span of…
In this article we will show that for every natural $d$ and $n>1$ there exists a natural number $t$ such that for every $d$-dimensional simplicial complex $\mathcal{T}$ with vertices in $\mathbb{Z}^d$, the number of lattice points in the $t^{\mathrm{th}}$ dilate of $\mathcal{T}$ is exactly $χ(\mathcal{T})$ modulo $n$, where $χ(\mathcal{T})$ is the Euler characteristic of $\mathcal{T}$.
The Euler--Maclaurin (EM) summation formula is used in many theoretical studies and numerical calculations. It approximates the sum $\sum_{k=0}^{n-1} f(k)$ of values of a function $f$ by a linear combination of a corresponding integral of $f$ and values of its higher-order derivatives $f^{(j)}$. An alternative (Alt) summation formula was recently presented by the author, which approximates the sum by a linear combination of integrals only, without using high-order derivatives of $f$. It was shown that the Alt formula will in most cases outperform, or greatly outperform, the EM formula in terms…
We show that minimal models of nondegenerated hypersufaces defined by Laurent polynomials with a $d$-dimensional Newton polytope $Δ$ are Calabi-Yau varieties $X$ if and only if the Fine interior of $Δ$ consists of a single lattice point. We give a combinatorial formula for computing the stringy Euler number of $X$. This formula allows to test mirror symmetry in cases when $Δ$ is not a reflexive polytope. In particular we apply this formula to pairs of lattice polytopes $(Δ, Δ^{\vee})$ that appear in the Mavlyutov's generalization of the polar duality for reflexive polytopes. Some examples of M…
We define nondegenerate tropical complete intersections imitating the corresponding definition in complex algebraic geometry. As in the complex situation, all nonzero intersection multiplicity numbers between tropical hypersurfaces defining a nondegenerate tropical complete intersection are equal to 1. The intersection multiplicity numbers we use are sums of mixed volumes of polytopes which are dual to cells of the tropical hypersurfaces. We show that the Euler characteristic of a real nondegenerate tropical complete intersection depends only on the Newton polytopes of the tropical polynomials…
In the special case of braid fans, we give a combinatorial formula for the Berline-Vergne's construction for an Euler-Maclaurin type formula that computes number of lattice points in polytopes. Our formula is obtained by computing a symmetric expression for the Todd class of the permutohedral variety. By showing that this formula does not always have positive values, we prove that the Todd class of the permutohedral variety $X_d$ is not effective for $d\geq 24$. Additionally, we prove that the linear coefficient in the Ehrhart polynomial of any lattice generalized permutohedron is positive.
A renowned theorem of Blind and Mani, with a constructive proof by Kalai and an efficiency proof by Friedman, shows that the whole face lattice of a simple polytope can be determined from its graph. This is part of a broader story of reconstructing face lattices from partial information, first considered comprehensively in Grünbaum's 1967 book. This survey paper includes varied results and open questions by many researchers on simplicial polytopes, nearly simple polytopes, cubical polytopes, zonotopes, crosspolytopes, and Eulerian posets.
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and other combinatorial structures. Among the illustrative examples are an Euler formula for a class of `continuous convex polytopes' (conjectured by Kalai and Wigderson), a duality result for a class of `continuous matroids', a calculation of the Euler characteristic of ideals in the Grassmannian poset (related to a problem of Gian-Carlo Rota), an exposition of t…
The Möbius polynomial is an invariant of ranked posets, closely related to the Möbius function. In this paper, we study the Möbius polynomial of face posets of convex polytopes. We present formulas for computing the Möbius polynomial of the face poset of a pyramid or a prism over an existing polytope, or of the gluing of two or more polytopes in terms of the Möbius polynomials of the original polytopes. We also present general formulas for calculating Möbius polynomials of face posets of simplicial polytopes and of Eulerian posets in terms of their $f$-vectors and some additional constraints.
We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory of Ehrhart polynomials to obtain properties of modular and integral flow polynomials. The emphasis is on the geometrical treatment through subgroup arrangements and Ehrhart polynomials. Such viewpoint leads to a reciprocity law for the modular flow polynomial, which gives rise to an interpretation on the values of the modular flow polynomial at negative inte…
The flag vector contains all the face incidence data of a polytope, and in the poset setting, the chain enumerative data. It is a classical result due to Bayer and Klapper that for face lattices of polytopes, and more generally, Eulerian graded posets, the flag vector can be written as a cd-index, a non-commutative polynomial which removes all the linear redundancies among the flag vector entries. This result holds for regular CW complexes. We relax the regularity condition to show the cd-index exists for Whitney stratified manifolds by extending the notion of a graded poset to that of a quasi…
The diamond product is the poset operation that when applied to the face lattices of two polytopes results in the face lattice of the Cartesian product of the polytopes. Application of the diamond product to two Eulerian posets is a bilinear operation on the cd-indices of the two posets, yielding a product on cd-polynomials. A lattice path interpretation is provided for this product of two cd-monomials.
Motivated by applications to multiplicity formulas in index theory, we study a family of distributions $Θ(m;k)$ associated to a piecewise quasi-polynomial function $m$. The family is indexed by an integer $k \in \mathbb{Z}_{>0}$, and admits an asymptotic expansion as $k \rightarrow \infty$, which generalizes the expansion obtained in the Euler-Maclaurin formula. When $m$ is the multiplicity function arising from the quantization of a symplectic manifold, the leading term of the asymptotic expansion is the Duistermaat-Heckman measure. Our main result is that $m$ is uniquely determined by a coll…
We continue our study of intermediate sums over polyhedra, interpolating between integrals and discrete sums, which were introduced by A. Barvinok [Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comp. 75 (2006), 1449-1466]. By well-known decompositions, it is sufficient to consider the case of affine cones s+c, where s is an arbitrary real vertex and c is a rational polyhedral cone. For a given rational subspace L, we integrate a given polynomial function h over all lattice slices of the affine cone s + c parallel to the subspace L and sum up the integrals. We study these …
Let P be a convex polytope not simple in general. In the focus of this paper lies a simplicial complex K_P which carries complete information about the combinatorial type of P. In the case when P is simple, K_P is the same as dP*, where P* is a polar dual polytope. Using the canonical embedding of a polytope P into nonnegative orthant, we introduce a moment-angle space Z_P for a polytope P. It is known, that in the case when P is simple the space Z_P is homeomorphic to the polyhedral product (D^2,S^1)^{K_P}. When P is not simple, we prove that the space Z_P is homotopically equivalent to the s…
There are natural polynomial invariants of polytopes and lattice polytopes coming from enumerative combinatorics and Ehrhart theory, namely the $h$- and $h^*$-polynomials, respectively. In this paper, we study their generalization to subdivisions and lattice subdivisions of polytopes. By abstracting constructions in mixed Hodge theory, we introduce multivariable polynomials which specialize to the $h$-, $h^*$- polynomials. These polynomials, the mixed $h$-polynomial and the (refined) limit mixed $h^*$-polynomial have rich symmetry, non-negativity, and unimodality properties, which both refine …
