English
Related papers

Related papers: Quasi-period collapse in half-integral polygons

200 papers

A positroid is a matroid realized by a matrix such that all maximal minors are non-negative. Positroid polytopes are matroid polytopes of positroids. In particular, they are lattice polytopes. The Ehrhart polynomial of a lattice polytope…

Combinatorics · Mathematics 2025-01-20 Yuhan Jiang

If P is a rational polytope in R^d, then $i_P(t):=#(tP\cap Z^d)$ is a quasi-polynomial in t, called the Ehrhart quasi-polynomial of P. A period of i_P(t) is D(P), the smallest positive integer D such that D*P has integral vertices. Often,…

Combinatorics · Mathematics 2015-05-08 Kevin M. Woods

A function g, with domain the natural numbers, is a quasi-polynomial if there exists a period m and polynomials p_0,p_1,...,p_{m-1} such that g(t)=p_i(t) for t=i mod m. Quasi-polynomials classically -- and "reasonably" -- appear in Ehrhart…

Combinatorics · Mathematics 2014-03-04 Kevin Woods

We show that the number of lattice points in the boundary of a positive integer dilate of a Delzant integral polytope is a polynomial in the dilation parameter, analogous to the Ehrhart polynomial giving the number of lattice points in a…

Combinatorics · Mathematics 2026-01-21 Jonathan Weitsman

The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…

Combinatorics · Mathematics 2017-06-07 Sören Berg , Katharina Jochemko , Laura Silverstein

We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…

Combinatorics · Mathematics 2024-02-20 Jesús A. De Loera , Laura Escobar , Nathan Kaplan , Chengyang Wang

We investigate the sign patterns of coefficients in the Ehrhart polynomial of the Cartesian product between the $r$-th pyramid over the Reeve tetrahedron and the hypercube $[0, n]^n$. This investigation yields partial results on the sign…

Combinatorics · Mathematics 2025-12-01 Feihu Liu , Sihao Tao , Guoce Xin

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…

Combinatorics · Mathematics 2017-12-13 Tiago Royer

Consider the Wronskians of the classical Hermite polynomials $$H_{\lambda, l}(x):=\mathrm{Wr}(H_l(x),H_{k_1}(x),\ldots, H_{k_n}(x)), \quad l \in \mathbb Z_{\geq 0},$$ where $k_i=\lambda_i+n-i, \,\, i=1,\dots, n$ and $\lambda=(\lambda_1,…

Mathematical Physics · Physics 2016-04-20 William A. Haese-Hill , Martin A. Hallnäs , Alexander P. Veselov

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

Characteristic quasi-polynomials enumerate the number of points in the complement of hyperplane arrangements modulo positive integers. In this paper, we compute the characteristic quasi-polynomials of the restrictions of the Shi…

Combinatorics · Mathematics 2026-02-09 Akihiro Higashitani , Masato Konoike , Norihiro Nakashima , Satoshi Ono

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…

Combinatorics · Mathematics 2007-05-23 Alexander Barvinok

We give novel and explicit formulas for the Ehrhart quasi-polynomials of rational simple polytopes, in terms of Barnes polynomials and discrete moments of half-open parallelepipeds. These formulas also hold for all positive dilations of a…

Combinatorics · Mathematics 2026-02-02 Sinai Robins

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…

Combinatorics · Mathematics 2020-02-11 Johannes Hofscheier , Benjamin Nill , Dennis Öberg

In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…

Number Theory · Mathematics 2016-03-18 Eugen J. Ionascu

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…

Combinatorics · Mathematics 2018-02-21 Akihiro Higashitani , Mikiya Masuda

Motivated by questions from Ehrhart theory, we present new results on discrete equidecomposability. Two rational polygons $P$ and $Q$ are said to be discretely equidecomposable if there exists a piecewise affine-unimodular bijection…

Combinatorics · Mathematics 2014-12-02 Paxton Turner , Yuhuai Wu

We use the residue theorem to derive an expression for the number of lattice oints in a dilated n-dimensional tetrahedron with vertices at lattice points on each coordinate axis and the origin. This expression is known as the Ehrhart…

Combinatorics · Mathematics 2007-05-23 Matthias Beck

Given a lattice polygon $P$ with $g$ interior lattice points, we associate to it the moduli space of tropical curves of genus $g$ with Newton polygon $P$. We completely classify the possible dimensions such a moduli space can have. For…

Let A be a subspace arrangement and let chi(A,t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(B_n), where B_n is the type B Weyl arrangement, then chi(A,t) counts a…

Combinatorics · Mathematics 2007-05-23 Andreas Blass , Bruce E. Sagan