English
Related papers

Related papers: Universal Counting of Lattice Points in Polytopes

200 papers

M. Beck, J. De Loera, M. Develin, J. Pfeifle and R. Stanley found that the roots of the Ehrhart polynomial of a d-dimensional lattice polytope are bounded above in norm by 1+(d+1)!. We provide an improved bound which is quadratic in d and…

Combinatorics · Mathematics 2010-07-23 Benjamin Braun

We present lower bounds for the coefficients of Ehrhart polynomials of convex lattice polytopes in terms of their volume. Concerning the coefficients of the Ehrhart series of a lattice polytope we show that Hibi's lower bound is not true…

Metric Geometry · Mathematics 2008-02-26 Martin Henk , Makoto Tagami

We present new ideas for computing elliptic Gau{\ss} sums, which constitute an analogue of the classical cyclotomic Gau{\ss} sums and whose use has been proposed in the context of counting points on elliptic curves and primality tests. By…

Number Theory · Mathematics 2017-07-26 Christian J. Berghoff

We provide an elementary proof of a formula for the number of northeast lattice paths that lie in a certain region of the plane. Equivalently, this formula counts the lattice points inside the Pitman--Stanley polytope of an n-tuple.

Combinatorics · Mathematics 2010-03-15 Lara K. Pudwell , Eric S. Rowland

We give a new proof for a theorem of Ehrhart regarding the quasi-polynomiality of the function that counts the number of integer points in the integral dilates of a rational polytope. The proof involves a geometric bijection,…

Combinatorics · Mathematics 2012-12-27 Steven V Sam

We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…

Combinatorics · Mathematics 2024-11-19 Martin Bohnert , Justus Springer

For a lattice polytope P, define A_P(t) as the sum of the solid angles of all the integer points in the dilate tP. Ehrhart and Macdonald proved that A_P(t) is a polynomial in the positive integer variable t. We study the numerator…

Combinatorics · Mathematics 2015-06-29 Matthias Beck , Sinai Robins , Steven V Sam

We estimate the lattice sums arising in the context of the integer point counting in polyhedra.

Combinatorics · Mathematics 2026-05-14 M. M. Skriganov

Hurwitz numbers are the Laurent coefficients of an elliptic function $\wp(u)$ of cyclotomic type, and they are natural generalization of the Bernoulli numbers. This paper gives new generalization of Bernoulli and Hurwitz numbers for higher…

Number Theory · Mathematics 2007-05-23 Yoshihiro Ônishi

A theorem of Howe states that every 3-dimensional lattice polytope $P$ whose only lattice points are its vertices, is a Cayley polytope, i.e. $P$ is the convex hull of two lattice polygons with distance one. We want to generalize this…

Combinatorics · Mathematics 2008-09-11 Jaron Treutlein

We consider the integer point transform $\sigma _P (\mathbf{x}) = \sum _{\mathbf{m} \in P\cap \mathbb{Z}^n} \mathbf{x}^\mathbf{m} \in \mathbb C [x_1^{\pm 1},\ldots, x_n^{\pm 1}]$ of a polytope $P\subset \mathbb{R}^n$. We show that if $P$ is…

Combinatorics · Mathematics 2019-04-24 Katharina Jochemko

The number of clusters per site $n(p)$ in percolation at the critical point $p = p_c$ is not itself a universal quantity---it depends upon the lattice and percolation type (site or bond). However, many of its properties, including…

Statistical Mechanics · Physics 2017-11-22 Stephan Mertens , Iwan Jensen , Robert M. Ziff

It is shown that there exist such a function g from L^1[0,1] and a weight function 0<u(x)<=1 that g is universal for the weighted space L^1_u[0,1] with respect to signs of its Fourier-Walsh coefficients.

Functional Analysis · Mathematics 2017-01-23 Artsrun Sargsyan , Martin Grigoryan

Building from the work of von Bell et al.~(2022), we study the Ehrhart theory of order polytopes arising from a special class of distributive lattices, known as generalized snake posets. We present arithmetic properties satisfied by the…

Combinatorics · Mathematics 2026-03-02 Eon Lee , Andrés R. Vindas-Meléndez , Zhi Wang

We show that the problem of deciding whether a given Euclidean lattice L has an orthonormal basis is in NP and co-NP. Since this is equivalent to saying that L is isomorphic to the standard integer lattice, this problem is a special form of…

Discrete Mathematics · Computer Science 2019-10-10 Christoph Hunkenschröder

We prove that every polytope described by algebraic coordinates is the face of a projectively unique polytope. This provides a universality property for projectively unique polytopes. Using a closely related result of Below, we construct a…

Metric Geometry · Mathematics 2013-06-14 Karim Alexander Adiprasito , Arnau Padrol

We study the higher-order Euler polynomials and give the corresponding monic orthogonal polynomials, which are Meixner-Pollaczek polynomials with certain arguments and constant factors. Moreover, through a general connection between moments…

Combinatorics · Mathematics 2018-08-14 Lin Jiu , Diane Yahui Shi

We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…

Logic in Computer Science · Computer Science 2025-01-30 Cécilia Pradic

Fix two lattice paths $P$ and $Q$ from $(0,0)$ to $(m,r)$ that use East and North steps with $P $ never going above $Q$. Bonin et al. show that the lattice paths that go from $(0,0)$ to $(m,r)$ and remain bounded by $P$ and $Q$ can be…

Combinatorics · Mathematics 2012-12-27 Hoda Bidkhori

We generalize R. P. Stanley's celebrated theorem that the $h^\ast$-polynomial of the Ehrhart series of a rational polytope has nonnegative coefficients and is monotone under containment of polytopes. We show that these results continue to…