Related papers: Ehrhart-Macdonald reciprocity extended

In arXiv:1709.07504 Aguiar and Ardila give a Hopf monoid structure on hypergraphs as well as a general construction of polynomial invariants on Hopf monoids. Using these results, we define in this paper a new polynomial invariant on…

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

Some finite series of harmonic numbers involving certain reciprocals are evaluated. Products of such reciprocals are expanded in a sum of the individual reciprocals, leading to a computer program. A list of examples is provided.

We establish the reciprocity law along a vertical curve for residues of differential forms on arithmetic surfaces, and describe Grothendieck's trace map of the surface as a sum of residues. Points at infinity are then incorporated into the…

The Ehrhart polynomial $L_P$ of an integral polytope $P$ counts the number of integer points in integral dilates of $P$. Ehrhart polynomials of polytopes are often described in terms of their Ehrhart $h^*$-vector (aka Ehrhart…

Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…

We consider an algebraic surface. For an irreducible curve on this surface and for a point on this curve one can associate an artinian ring, which is a sum of two-dimensional local fields. An example of two-dimensional local field is…

Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P(n) = nP$ is a quasi-polynomial in $n$. We generalize this theorem by allowing the vertices of P(n) to…

We express the generating function for lattice points in a rational polyhedral cone with a simplicial subdivision in terms of multivariate analogues of the h-polynomials of the subdivision and "local contributions" of the links of its…

This article provides a comprehensive exposition about inequalities that the coefficients of Ehrhart polynomials and $h^*$-polynomials satisfy under various assumptions. We pay particular attention to the properties of Ehrhart positivity as…

In this paper, we study the generalized Dedekind-Rademacher sums considered by Hall, Wilson and Zagier. We establish a formula for the products of two Bernoulli functions. The proof relies on Parseval's formula, Hurwitz's formula, and…

In this paper we calculate the Ehrhart's polynomial associated with a 2-dimensional regular polytope (i.e. equilateral triangles) in $\mathbb Z^3$. The polynomial takes a relatively simple form in terms of the coordinates of the vertices of…

We give a simple proof for the reciprocity formulas of character Dedekind sums associated with two primitive characters, whose modulus need not to be same, by utilizing the character analogue of the Euler-MacLaurin summation formula.…

We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…

Even after several decades of systematic usage of X-ray diffraction as one of the major analytical tool for epitaxic layers, the vision of the reciprocal space of these materials is still a simple superposition of two reciprocal lattices,…

We connect Dedekind sums and some formulas for numerical semigroups.

Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…

We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…

Let $\mathcal{P} \subset \mathbb{R}^N$ be an integral convex polytope of dimension $d$ and write $k \mathcal{P}$, where $k = 1, 2, \ldots$, for dilations of $\mathcal{P}$. We say that $\mathcal{P}$ possesses the integer decomposition…