English
Related papers

Related papers: Boundary $h^\ast$-polynomials of rational polytope…

200 papers

A lattice polytope translated by a rational vector is called an almost integral polytope. In this paper we investigate Ehrhart quasi-polynomials of almost integral polytopes. We study the relationship between the shape of the polytopes and…

Combinatorics · Mathematics 2023-08-31 Christopher de Vries , Masahiko Yoshinaga

There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…

Combinatorics · Mathematics 2007-05-23 Fu Liu

In multicentric calculus one takes a polynomial $p$ with distinct roots as a new variable and represents complex valued functions by $\mathbb C^d$-valued functions, where $d$ is the degree of $p$. An application is e.g. the possibility to…

Complex Variables · Mathematics 2021-04-23 Diana Andrei , Olavi Nevanlinna , Tiina Vesanen

With any integer convex polytope $P\subset\midR^n$ we associate a multivariate hypergeometric polynomial whose set of exponents is $\midZ^{n}\cap P.$ This polynomial is defined uniquely up to a constant multiple and satisfies a holonomic…

Complex Variables · Mathematics 2016-12-05 D. V. Bogdanov , T. M. Sadykov

The family of lattice simplices in $\mathbb{R}^n$ formed by the convex hull of the standard basis vectors together with a weakly decreasing vector of negative integers include simplices that play a central role in problems in enumerative…

Combinatorics · Mathematics 2017-10-05 Liam Solus

Graded Ehrhart theory is a new $q$-analogue of Ehrhart theory based on the orbit harmonics method. We study the graded Ehrhart theory of unimodular zonotopes from a matroid-theoretic perspective. Generalizing a result of Stanley (1991), we…

Combinatorics · Mathematics 2026-03-10 Colin Crowley , Ethan Partida

We study a class of polynomials that has all of its roots on the critical line and shares many properties with Ehrhart polynomials. Braun showed that the roots of Ehrhart polynomials are bounded quadratically and Higashitani provided…

Combinatorics · Mathematics 2022-07-19 Max Kölbl

We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice…

Combinatorics · Mathematics 2007-05-23 Alexander Barvinok , Kevin Woods

Let S be an abelian semigroup, and A a finite subset of S. The sumset hA consists of all sums of h elements of A, with repetitions allowed. Let |hA| denote the cardinality of hA. Elementary lattice point arguments are used to prove that an…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson , Imre Z. Ruzsa

In this paper we give a combinatorial view on the adjunction theory of toric varieties. Inspired by classical adjunction theory of polarized algebraic varieties we define two convex-geometric notions: the Q-codegree and the nef value of a…

Combinatorics · Mathematics 2016-01-20 Sandra Di Rocco , Christian Haase , Benjamin Nill , Andreas Paffenholz

We give a $K$-theoretic and geometric interpretation for a generalized weighted Ehrhart theory of a full-dimensional lattice polytope $P$, depending on a given homogeneous polynomial function $\varphi$ on $P$, and with Laurent polynomial…

Algebraic Geometry · Mathematics 2025-12-30 Laurenţiu Maxim , Jörg Schürmann

Let ${\cal P}=\{h_1, ..., h_s\}\subset \Z[Y_1, ..., Y_k]$, $D\geq \deg(h_i)$ for $1\leq i \leq s$, $\sigma$ bounding the bit length of the coefficients of the $h_i$'s, and $\Phi$ be a quantifier-free ${\cal P}$-formula defining a convex…

Symbolic Computation · Computer Science 2009-10-16 Mohab Safey El Din , Lihong Zhi

We study the equivariant Ehrhart theory of families of polytopes that are invariant under a non-trivial action of the group with order two. We study families of polytopes whose equivariant $H^*$-polynomial both succeed and fail to be…

Combinatorics · Mathematics 2023-02-15 Oliver Clarke , Akihiro Higashitani , Max Kölbl

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

In Ehrhart theory, the well-known sign pattern problem asks: given a positive integer $d\geq 3$ and integers $1 \leq i_1 < \cdots < i_k \leq d-2$, does there exist a $d$-dimensional integral polytope $\mathcal{P}$ such that in its Ehrhart…

Combinatorics · Mathematics 2026-05-26 Feihu Liu , Sihao Tao , Guoce Xin

We work in the setting of weighted pluripotential theory arising from polynomials associated to a convex body $P$ in $({\bf R}^+)^d$. We define the {\it logarithmic indicator function} on ${\bf C}^d$: $$H_P(z):=\sup_{ J\in P} \log |z^{…

Complex Variables · Mathematics 2023-10-30 T. Bayraktar , S. Hussung , N. Levenberg , M. Perera

As shown by McMullen in 1983, the coefficients of the Ehrhart polynomial of a lattice polytope can be written as a weighted sum of facial volumes. The weights in such a local formula depend only on the outer normal cones of faces, but are…

Metric Geometry · Mathematics 2025-10-01 Maren H. Ring , Achill Schürmann

It is shown that, for each $d \geq 4$, there exists an integral convex polytope $\mathcal{P}$ of dimension $d$ such that each of the coefficients of $n, n^{2}, \ldots, n^{d-2}$ of its Ehrhart polynomial $i(\mathcal{P},n)$ is negative.…

Combinatorics · Mathematics 2016-05-03 Takayuki Hibi , Akihiro Higashitani , Akiyoshi Tsuchiya , Koutarou Yoshida

A subset $S$ of vertices of a graph $G$ is called a perfectly matchable set of $G$ if the subgraph induced by $S$ contains a perfect matching. The perfectly matchable set polynomial of $G$, first made explicit by Ohsugi and Tsuchiya, is the…

Combinatorics · Mathematics 2022-08-01 Robert Davis , Florian Kohl

Let $K$ be a smooth convex set with volume one in $\BBR^d$. Choose $n$ random points in $K$ independently according to the uniform distribution. The convex hull of these points, denoted by $K_n$, is called a {\it random polytope}. We prove…

Probability · Mathematics 2007-05-23 Van Vu