English
Related papers

Related papers: Projecting lattice polytopes according to the Mini…

200 papers

Lattice-free sets (convex subsets of $\mathbb{R}^d$ without interior integer points) and their applications for cutting-plane methods in mixed-integer optimization have been studied in recent literature. Notably, the family of all integral…

Combinatorics · Mathematics 2015-09-18 Gennadiy Averkov , Jan Krümpelmann , Stefan Weltge

After giving a short introduction on smooth lattice polytopes, I will present a proof for the finiteness of smooth lattice polytopes with few lattice points. The argument is then turned into an algorithm for the classification of smooth…

Combinatorics · Mathematics 2010-01-05 Benjamin Lorenz

We show that any smooth lattice polytope P with codegree greater or equal than (dim(P)+3)/2 (or equivalently, with degree smaller than dim(P)/2), defines a dual defective projective toric manifold. This implies that P is Q-normal (in the…

Combinatorics · Mathematics 2010-01-19 Alicia Dickenstein , Benjamin Nill

Self-maps everywhere defined on the projective space $\P^N$ over a number field or a function field are the basic objects of study in the arithmetic of dynamical systems. One reason is a theorem of Fakkruddin \cite{Fakhruddin} (with…

Number Theory · Mathematics 2011-05-10 Benjamin Hutz , Lucien Szpiro

The diameter of the graph of a $d$-dimensional lattice polytope $P \subseteq [0,k]^{n}$ is known to be at most $dk$ due to work by Kleinschmidt and Onn. However, it is an open question whether the monotone diameter, the shortest guaranteed…

Optimization and Control · Mathematics 2022-04-21 Alexander E. Black

We show that, if the interior of a lattice d-polytope P contains at least one lattice point, then it contains a lattice point whose coefficient of asymmetry with respect to P is at most b for some number b depending on d only. As an…

Combinatorics · Mathematics 2007-05-23 Oleg Pikhurko

Let $d \geq 0$ be an integer and let $P \subset \mathbb R^d$ be a $d$-dimensional lattice polytope. We call a polytope $M \subset \mathbb R^d$ such that $M \subset P$ and $M \sim P$ a {\itshape miniature} of $P,$ and it is said to be…

Combinatorics · Mathematics 2026-05-21 Takashi Hirotsu

The Voronoi conjecture on parallelohedra claims that for every convex polytope $P$ that tiles Euclidean $d$-dimensional space with translations there exists a $d$-dimensional lattice such that $P$ and the Voronoi polytope of this lattice…

Combinatorics · Mathematics 2021-12-20 Alexey Garber

The maximal degree of monomials belonging to the unique minimal system of monomial generators of the canonical module $\omega(K[{\mathcal P}])$ of the toric ring $K[{\mathcal P}]$ defined by a lattice polytope ${\mathcal P}$ will be…

Commutative Algebra · Mathematics 2024-02-14 Winfried Bruns , Takayuki Hibi

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

Combinatorics · Mathematics 2007-05-23 Anders Björner

We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…

Combinatorics · Mathematics 2011-12-14 Joseph Gubeladze

Let $X$ be an irreducible, reduced complex projective hypersurface of degree $d$. A point $P$ not contained in $X$ is called uniform if the monodromy group of the projection of $X$ from $P$ is isomorphic to the symmetric group $S_d$. We…

Algebraic Geometry · Mathematics 2020-02-25 Maria Gioia Cifani , Alice Cuzzucoli , Riccardo Moschetti

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

Let $L$ be an ample line bundle over a smooth projective toric surface $X$. Then $L$ corresponds to a very ample lattice polytope $P$ that encodes many geometric properties of $L$. In this article, by studying $P$, we will give some…

Algebraic Geometry · Mathematics 2019-01-24 Bach Le Tran

For a given lattice polytope $P$ in $\mathbb{R}^3$, consider the space $\mathcal{L}_P$ of trivariate polynomials over a finite field $\mathbb{F}_q$, whose Newton polytopes are contained in $P$. We give an upper bound for the maximum number…

Combinatorics · Mathematics 2022-02-01 Kyle Meyer , Ivan Soprunov , Jenya Soprunova

A quadratic lattice $M$ over a Dedekind domain $R$ with fraction field $F$ is defined to be a finitely generated torsion-free $R$-module equipped with a non-degenerate quadratic form on the $F$-vector space $F\otimes_{R}M$. Assuming that…

Number Theory · Mathematics 2026-03-27 Yong Hu , Jing Liu , Fei Xu

We construct a hollow lattice polytope (resp. a hollow lattice simplex) of dimension $14$ (resp.$~404$) and of width $15$ (resp.$~408$). They are the first known hollow lattice polytopes of width larger than dimension. We also construct a…

Combinatorics · Mathematics 2019-12-24 Giulia Codenotti , Francisco Santos

It is pretty well-known that toric Fano varieties of dimension k with terminal singularities correspond to convex lattice polytopes P in R^k of positive finite volume, such that intersection of P and Z^k consists of the point 0 and vertices…

Algebraic Geometry · Mathematics 2007-05-23 Alexandr Borisov

We study the Minkowski length L(P) of a lattice polytope P, which is defined to be the largest number of non-trivial primitive segments whose Minkowski sum lies in P. The Minkowski length represents the largest possible number of factors in…

Combinatorics · Mathematics 2012-07-31 Olivia Beckwith , Matthew Grimm , Jenya Soprunova , Bradley Weaver

For a lattice $L$ of $R^n$, a sphere $S(c,r)$ of center $c$ and radius $r$ is called {\em empty} if for any $v\in L$ we have $\Vert v - c\Vert \geq r$. Then the set $S(c,r)\cap L$ is the vertex set of a {\em Delaunay polytope}…

Metric Geometry · Mathematics 2016-08-08 Mathieu Dutour Sikiric