English
Related papers

Related papers: Coprime Ehrhart theory and counting free segments

200 papers

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…

The Ehrhart polynomial of a lattice polytope $P$ encodes information about the number of integer lattice points in positive integral dilates of $P$. The $h^\ast$-polynomial of $P$ is the numerator polynomial of the generating function of…

Combinatorics · Mathematics 2019-03-06 Matthias Beck , Katharina Jochemko , Emily McCullough

Ehrhart polynomials are extensively-studied structures that interpolate the discrete volume of the dilations of integral $n$-polytopes. The coefficients of Ehrhart polynomials, however, are still not fully understood, and it is not known…

Combinatorics · Mathematics 2021-01-22 Fiona Abney-McPeek , Sanket Biswas , Senjuti Dutta , Yongyuan Huang , Deyuan Li , Nancy Xu

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

Let $\mathbb{Z}^2$ be the two-dimensional integer lattice. For an integer $k\geq 1$, a non-zero lattice point is $k$-free if the greatest common divisor of its coordinates is a $k$-free number. We consider the proportions of $k$-free and…

Number Theory · Mathematics 2022-02-08 Kui Liu , Shunqi Ma

We present examples of smooth lattice polytopes in dimensions 3 and higher where each coefficient of their Ehrhart polynomials that can potentially be negative is indeed negative. This answers a question by Bruns. We also discuss…

Combinatorics · Mathematics 2018-06-21 Federico Castillo , Fu Liu , Benjamin Nill , Andreas Paffenholz

A rational polytope is the convex hull of a finite set of points in $\R^d$ with rational coordinates. Given a rational polytope $P \subseteq \R^d$, Ehrhart proved that, for $t\in\Z_{\ge 0}$, the function $#(tP \cap \Z^d)$ agrees with a…

Combinatorics · Mathematics 2010-05-04 Steven V Sam , Kevin M. Woods

Ehrhart's famous theorem states that the number of integral points in a rational polytope is a quasi-polynomial in the integral dilation factor. We study the case of rational dilation factors and it turns out that the number of integral…

Combinatorics · Mathematics 2011-03-04 Eva Linke

A lattice polytope is called spanning if its lattice points affinely span the ambient lattice. We show as a corollary to a general result in the Ehrhart theory of lattice polytopes that the $h^*$-vector of a spanning lattice polytope has no…

Combinatorics · Mathematics 2019-10-25 Johannes Hofscheier , Lukas Katthän , Benjamin Nill

We extend the asymptotic formula for counting integral matrices with a given irreducible characteristic polynomial by Eskin, Mozes and Shah in 1996 to the case of counting elements in a maximal order of certain central simple algebra with a…

Number Theory · Mathematics 2025-03-05 Jiaqi Xie

We introduce the notion of a weighted $\delta$-vector of a lattice polytope. Although the definition is motivated by motivic integration, we study weighted $\delta$-vectors from a combinatorial perspective. We present a version of Ehrhart…

Combinatorics · Mathematics 2009-07-10 Alan Stapledon

The conjecture of Kalai, Kleinschmidt, and Lee on the number of empty simplices of a simplicial polytope is established by relating it to the first graded Betti numbers of the polytope. The proof allows us to derive explicit optimal bounds…

Commutative Algebra · Mathematics 2007-05-23 Uwe Nagel

The $n$-dimensional lattice polytopes $\mathcal{Q}_{n,k}$ obtained by intersecting the $n$th dilate of the standard $n$-dimensional simplex in $\mathbb{R}^n$ with the half-spaces $x_i \le 1$ for $1 \le i \le k$ form an interesting special…

Combinatorics · Mathematics 2026-03-13 Christos A. Athanasiadis , Qiqi Xiao , Xue Yan

Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…

Combinatorics · Mathematics 2026-05-27 Frédéric Chapoton , Christos A. Athanasiadis

We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…

Combinatorics · Mathematics 2010-01-24 Matthias Beck , Thomas Zaslavsky

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

Combinatorics · Mathematics 2015-05-08 Sven Verdoolaege , Kevin Woods

Equivariant Ehrhart theory generalizes the study of lattice point enumeration to also account for the symmetries of a polytope under a linear group action. We present a catalogue of techniques with applications in this field, including…

Combinatorics · Mathematics 2022-05-13 Sophia Elia , Donghyun Kim , Mariel Supina

In 1997 the author found a criterion for the Riemann hypothesis for the Riemann zeta function, involving the nonnegativity of certain coefficients associated with the Riemann zeta function. In 1999 Bombieri and Lagarias obtained an…

Number Theory · Mathematics 2007-05-23 Xian-Jin Li

This paper gives an explicit formula for the Ehrhart quasi-polynomial of certain 2-dimensional polyhedra in terms of invariants of surface quotient singularities. Also, a formula for the dimension of the space of quasi-homogeneous…

Algebraic Geometry · Mathematics 2016-09-07 J. I. Cogolludo-Agustin , J. Martin-Morales , J. Ortigas-Galindo

Given a rational polytope $P \subset \mathbb R^d$, the numerical function counting lattice points in the integral dilations of $P$ is known to become a quasi-polynomial, called the Ehrhart quasi-polynomial $\mathrm{ehr}_P$ of $P$. In this…

Combinatorics · Mathematics 2024-11-01 Akihiro Higashitani , Satoshi Murai , Masahiko Yoshinaga