English
Related papers

Related papers: Lattice polytopes with a given $h^*$-polynomial

200 papers

We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…

Combinatorics · Mathematics 2013-09-23 Victor Batyrev , Johannes Hofscheier

The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…

Combinatorics · Mathematics 2008-09-29 Benjamin Nill

We give an effective upper bound on the h^*-polynomial of a lattice polytope in terms of its degree and leading coefficient, confirming a conjecture of Batyrev. We deduce this bound as a consequence of a strong Cayley decomposition theorem…

Combinatorics · Mathematics 2010-02-14 Christian Haase , Benjamin Nill , Sam Payne

The local $h^*$-polynomial of a lattice polytope is an important invariant arising in Ehrhart theory. Our focus is on lattice simplices presented in Hermite normal form with a single non-trivial row. We prove that when the off-diagonal…

For an $n$-dimensional lattice simplex $\Delta_{(1,\mathbf{q})}$ with vertices given by the standard basis vectors and $-\mathbf{q}$ where $\mathbf{q}$ has positive entries, we investigate when the Ehrhart $h^*$-polynomial for…

Combinatorics · Mathematics 2018-07-20 Benjamin Braun , Fu Liu

In this paper, we will prove that given a lattice simplex with its $h^*$-polynomial $\sum_{i \geq 0}h_i^*t^i$, if $h_{k+1}^*=\cdots=h_{2k}^*=0$ holds, then there exists a lattice simplex of degree $k$ whose $h^*$-polynomial coincides with…

Combinatorics · Mathematics 2018-12-27 Akihiro Higashitani

Let $\Delta$ be an $n$-dimensional lattice polytope. The smallest non-negative integer $i$ such that $k \Delta$ contains no interior lattice points for $1 \leq k \leq n - i$ we call the degree of $\Delta$. We consider lattice polytopes of…

Combinatorics · Mathematics 2011-11-09 Victor Batyrev , Benjamin Nill

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

Lattice polytopes are called IDP polytopes if they have the integer decomposition property, i.e., any lattice point in a $k$th dilation is a sum of $k$ lattice points in the polytope. It is a long-standing conjecture whether the numerator…

Combinatorics · Mathematics 2025-05-27 Johannes Hofscheier , Vadym Kurylenko , Benjamin Nill

Symmetric edge polytopes $\mathcal{A}_G$ of type A are lattice polytopes arising from the root system $A_n$ and finite simple graphs $G$. There is a connection between $\mathcal{A}_G$ and the Kuramoto synchronization model in physics. In…

Combinatorics · Mathematics 2022-01-26 Hidefumi Ohsugi , Akiyoshi Tsuchiya

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

A lattice polytope $\mathcal{P} \subset \mathbb{R}^d$ is called a locally anti-blocking polytope if for any closed orthant $\mathbb{R}^d_{\varepsilon}$ in $\mathbb{R}^d$, $\mathcal{P} \cap \mathbb{R}^d_{\varepsilon}$ is unimodularly…

Combinatorics · Mathematics 2022-01-26 Hidefumi Ohsugi , Akiyoshi Tsuchiya

If $P$ is a lattice polytope (that is, the convex hull of a finite set of lattice points in $\mathbf{R}^n$), then every sum of $h$ lattice points in $P$ is a lattice point in the $h$-fold sumset $hP$. However, a lattice point in the…

Number Theory · Mathematics 2020-04-17 Melvyn B. Nathanson

A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…

Combinatorics · Mathematics 2009-01-13 Jaron Treutlein

In this paper, we investigate two properties concerning the unimodality of the $\delta$-vectors of lattice polytopes, which are log-concavity and alternatingly increasingness. For lattice polytopes $\mathcal{P}$ of dimension $d$, we prove…

Combinatorics · Mathematics 2015-04-17 Akihiro Higashitani

The Ehrhart quasipolynomial of a rational polytope $P$ encodes the number of integer lattice points in dilates of $P$, and the $h^*$-polynomial of $P$ is the numerator of the accompanying generating function. We provide two decomposition…

Combinatorics · Mathematics 2024-09-24 Matthias Beck , Benjamin Braun , Andrés R. Vindas-Meléndez

The local $h^*$-polynomial is a natural invariant of a lattice polytope appearing in Ehrhart theory and Hodge theory. In this work, we study the question posed in [GKZ94] concerning the classification of lattice simplices with vanishing…

Combinatorics · Mathematics 2025-12-23 Vadym Kurylenko

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

We study semigroup algebras associated to lattice polytopes. We begin by generalizing and refining work of Hochster, and describe the volume maps of these algebras, that is, their fundamental classes, in terms of Parseval-Rayleigh…

Combinatorics · Mathematics 2025-09-18 Karim Alexander Adiprasito , Stavros Argyrios Papadakis , Vasiliki Petrotou

There are natural polynomial invariants of polytopes and lattice polytopes coming from enumerative combinatorics and Ehrhart theory, namely the $h$- and $h^*$-polynomials, respectively. In this paper, we study their generalization to…

Combinatorics · Mathematics 2021-10-05 Eric Katz , Alan Stapledon
‹ Prev 1 2 3 10 Next ›