Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.21507

A very ample lattice polytope with a non-unimodal $h^*$-vector

Johannes Hofscheier·Vadym Kurylenko·Benjamin Nill
View original source ↗Read source document ↗Export metadata ↓

Abstract

Lattice polytopes are called very ample if for every sufficiently large $k$ every lattice point of height $k$ in the cone over the lattice polytope is the sum of $k$ lattice points of height $1$. This is a weakening of the well-known integer decomposition property (also called IDP). We give an example of a very ample lattice polytope whose $h^*$-vector is non-unimodal. Here, the $h^*$-vector is the coefficient vector of the numerator of the Ehrhart series of the lattice polytope. This answers a question of Ferroni and Higashitani, as well as a related question by Balletti. The main question whether IDP lattice polytopes have unimodal $h^*$-vector is still open. The example was found using ChatGPT 5.6 Sol. It is just the Cartesian square of a lattice polytope belonging to a class of very ample examples constructed by Lasoń and Michalek.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Johannes Hofscheier, Vadym Kurylenko, Benjamin Nill. 2026-08-21. A very ample lattice polytope with a non-unimodal $h^*$-vector. https://arxiv.org/abs/2608.21507

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗