Related papers: Counting Lattice Points by means of the Residue Th…
This paper is dedicated to a lattice analog to the classical ``sum of interior angles of a polygon theorem''. In 2008, the first formula expressing conditions on the geometric continued fractions for lattice angles of triangles was derived,…
A generic orthotope is an orthogonal polytope whose tangent cones are described by read-once Boolean functions. The purpose of this note is to develop a theory ofEhrhart polynomials for integral generic orthotopes. The most remarkable part…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…
An algorithm to compute polynomial conserved densities of polynomial nonlinear lattices is presented. The algorithm is implemented in Mathematica and can be used as an automated integrability test. With the code diffdens.m, conserved…
We prove the exponent $4/3$ for the lattice point discrepancy of a torus in $\mathbb{R}^3$ (generated by the rotation of a circle around the $z$ axis). The exponent comes from a diagonal term and it seems a natural limit for any approach…
The Ehrhart function $L_P(t)$ of a polytope $P$ is usually defined only for integer dilation arguments $t$. By allowing arbitrary real numbers as arguments we may also detect integer points entering (or leaving) the polytope in fractional…
We establish a connection between the orbifold cohomology of hypertoric varieties and the Ehrhart theory of Lawrence polytopes. More specifically, we show that the dimensions of the orbifold cohomology groups of a hypertoric variety are…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
An integer point in a polyhedron is called irreducible iff it is not the midpoint of two other integer points in the polyhedron. We prove that the number of irreducible integer points in $n$-dimensional polytope with radius $k$ given by a…
We improve upon an Omega result due to Soundararajan with respect to general trigonometric polynomials having positive Fourier coefficients. Instead of Dirichlet's approximation theorem we employ the resonance method and this leads to…
We study the distribution of lattice points with prime coordinates lying in the dilate of a convex planar domain having smooth boundary, with nowhere vanishing curvature. Counting lattice points weighted by a von Mangoldt function gives an…
In the present paper, we introduce a multibasic extension of the Ehrhart theory. We give a multibasic extension of Ehrhart polynomials and Ehrhart series. We also show that an analogue of Ehrhart reciprocity holds for multibasic Ehrhart…
Using Euler's formula for a network of polygons for 2D case (or polyhedra for 3D case), we show that the number of dynamic\textit{\}degrees of freedom of the electric field equals the number of dynamic degrees of freedom of the magnetic…
We study the Ehrhart $h^\ast$-polynomial of (the boundary of) a lattice polytope via regular unimodular triangulations and Gr\"obner degenerations of toric ideals. Our main result is a boundary analogue of the well-known Sturmfels…
This paper provides some explicit formulas related to addition theorems for elliptic integrals $\int_0^x dt/R(t)$, where $R(t)$ is the square root from a polynomial of degree 4. These integrals are related to complex elliptic genera and are…
Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…
We introduce the notion of the second lattice width of a lattice polytope and use this to classify lattice triangles by their width and second width. This is equivalent to classifying lattice triangles contained in a given rectangle (and no…
We derive an Ehrhart function for symbols from the Euler-MacLaurin formula with remainder.
R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of…
We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…