English
Related papers

Related papers: The Minimum Period of the Ehrhart Quasi-polynomial…

200 papers

Let $s_{ij}$ represent a tranposition in $S_n$. A polynomial $P$ in $\mathbb{Q}[X_n]$ is said to be $m$-quasiinvariant with respect to $S_n$ if $(x_i-x_j)^{2m+1}$ divides $(1-s_{ij})P$ for all $1 \leq i, j \leq n$. We call the ring…

Combinatorics · Mathematics 2007-05-23 Jason Bandlow , Gregg Musiker

Recent work has focused on the roots z of the Ehrhart polynomial of a lattice polytope P. The case when Re(z) = -1/2 is of particular interest: these polytopes satisfy Golyshev's "canonical line hypothesis". We characterise such polytopes…

Combinatorics · Mathematics 2021-12-17 Gábor Hegedüs , Akihiro Higashitani , Alexander Kasprzyk

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

Let $n$ be a positive integer, not a power of two. A \textit{Reinhardt polygon} is a convex $n$-gon that is optimal in three different geometric optimization problems: it has maximal perimeter relative to its diameter, maximal width…

Metric Geometry · Mathematics 2012-09-28 Kevin G. Hare , Michael J. Mossinghoff

If $\mathcal{P}$ is a lattice polytope (i.e., $\mathcal{P}$ is the convex hull of finitely many integer points in $\mathbb{R}^d$), Ehrhart's famous theorem (1962) asserts that the integer-point counting function $|t \mathcal{P} \cap…

Combinatorics · Mathematics 2026-05-05 Matthias Beck , Thomas Kunze

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

Optimization and Control · Mathematics 2012-10-26 Tomáš Kepka , Miroslav Korbelář

The Minkowski length of a lattice polytope $P$ is a natural generalization of the lattice diameter of $P$. It can be defined as the largest number of lattice segments whose Minkowski sum is contained in $P$. The famous Ehrhart theorem…

Combinatorics · Mathematics 2020-12-22 Ivan Soprunov , Jenya Soprunova

We show that there exists a family of Knapsack polytopes such that, for each polytope P from this family and each {\epsilon} > 0, any {\epsilon}-approximated formulation of P in the original space R^n requires a number of inequalities that…

Optimization and Control · Mathematics 2015-03-18 Yuri Faenza , Laura Sanità

Polynomials $Q_n(z)$, $n=0,1,\ldots,$ that are multi-orthogonal with respect to a Nikishin system of $p\geq 1$ compactly supported measures over the star-like set of $p+1$ rays $S_+:=\{z\in \mathbb{C}: z^{p+1}\geq 0 \}$ are investigated. We…

Classical Analysis and ODEs · Mathematics 2019-10-16 Abey López-García , Erwin Miña-Díaz

The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice points in the $n$-th dilate of $P$ for all integers $n\geq 0$. The degree of $P$ is defined as the degree of its $h^\ast$-polynomial, a…

Combinatorics · Mathematics 2024-09-24 Matthias Beck , Ellinor Janssen , Katharina Jochemko

The Hilbert function, its generating function and the Hilbert polynomial of a graded ring R have been extensively studied since the famous paper of Hilbert: Ueber die Theorie der algebraischen Formen [Hil90]. In particular, the coefficients…

Commutative Algebra · Mathematics 2016-07-22 Massimo Caboara , Carla Mascia

For a prime $p$ and an integer $x$, the $p$-adic valuation of $x$ is denoted by $\nu_{p}(x)$. For a polynomial $Q$ with integer coefficients, the sequence of valuations $\nu_{p}(Q(n))$ is shown to be either periodic or unbounded. The first…

Number Theory · Mathematics 2017-08-15 Luis A. Medina , Victor H. Moll , Eric Rowland

It is proved that for every complex quadratic polynomial $f$ with Cremer's fixed point $z_0$ (or periodic orbit) for every $\delta>0$, there is at most one periodic orbit of minimal period $n$ for all $n$ large enough, entirely in the disc…

Dynamical Systems · Mathematics 2025-05-06 Feliks Przytycki

Let p > 2 be a prime, let n > m > 0. Let pi_n be the norm of zeta_{p^n} - 1 under C_{p-1}, so that Z_(p)[pi_n] | Z_(p) is a purely ramified extension of discrete valuation rings of degree p^{n-1}. The minimal polynomial of pi_n over Q(pi_m)…

Number Theory · Mathematics 2007-05-23 M. Kuenzer , E. Wirsing

A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of…

Metric Geometry · Mathematics 2007-09-14 Gennadiy Averkov , Martin Henk

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

For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…

Number Theory · Mathematics 2023-06-06 Riccardo Invernizzi , Daniele Taufer

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…

Combinatorics · Mathematics 2024-08-23 Luis Ferroni , Akihiro Higashitani

The purpose of this paper is to extend the scope of the Ehrhart theory to periodic graphs. We give sufficient conditions for the growth sequences of periodic graphs to be a quasi-polynomial and to satisfy the reciprocity laws. Furthermore,…

Combinatorics · Mathematics 2024-09-05 Takuya Inoue , Yusuke Nakamura

Let $P$ be a bounded convex subset of $\mathbb R^n$ of positive volume. Denote the smallest degree of a polynomial $p(X_1,\dots,X_n)$ vanishing on $P\cap\mathbb Z^n$ by $r_P$ and denote the smallest number $u\geq0$ such that every function…

Algebraic Geometry · Mathematics 2021-07-13 Fabian Gundlach