English
Related papers

Related papers: The Fine interior of dilations of a rational polyt…

200 papers

The Kodaira dimension of a nondegenerate toric hypersurface can be computed from the dimension of the Fine interior of its Newton polytope according to recent work of Victor Batyrev, where the Fine interior of the Newton polytope is the…

Algebraic Geometry · Mathematics 2025-07-04 Martin Bohnert

The Fine interior $\Delta^{\text{FI}}$ of a $d$-dimensional lattice polytope $\Delta$ is a rational subpolytope of $\Delta$ which is important for constructing minimal birational models of non-degenerate hypersurfaces defined by Laurent…

Algebraic Geometry · Mathematics 2022-10-28 Victor Batyrev , Alexander Kasprzyk , Karin Schaller

The Fine interior $F(P)$ of a $d$-dimensional lattice polytope $P \subset {\Bbb R}^d$ is the set of all points $y \in P$ having integral distance at least $1$ to any integral supporting hyperplane of $P$. We call a lattice polytope…

Algebraic Geometry · Mathematics 2023-08-01 Victor V. Batyrev

Let $Z$ be a nondegenerate hypersurface in $d$-dimensional torus $(\mathbb{C}^*)^d$ defined by a Laurent polynomial $f$ with a $d$-dimensional Newton polytope $P$. The subset $F(P) \subset P$ consisting of all points in $P$ having integral…

Algebraic Geometry · Mathematics 2023-05-10 Victor V. Batyrev

We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…

Combinatorics · Mathematics 2024-10-23 Martin Bohnert , Justus Springer

A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…

Optimization and Control · Mathematics 2011-03-28 Gennadiy Averkov , Christian Wagner , Robert Weismantel

A theorem of Howe states that every 3-dimensional lattice polytope $P$ whose only lattice points are its vertices, is a Cayley polytope, i.e. $P$ is the convex hull of two lattice polygons with distance one. We want to generalize this…

Combinatorics · Mathematics 2008-09-11 Jaron Treutlein

A perfect (Delaunay) ellipsoid is an ellipsoid in n-dimensional Euclidean space that does not contain integral points in its interior, but is uniquely defined by integral points that lie on its surface. A perfect Delaunay polytope with…

Number Theory · Mathematics 2007-05-23 Robert Erdahl , Konstantin Rybnikov

We compare three naturally occurring multi-indexed filtrations of ideals on the local ring of a Newton nondegenerate hypersurface surface singularity with rational homology sphere, which in many cases are all distinct. These are the…

Algebraic Geometry · Mathematics 2019-11-04 Baldur Sigurðsson

Originally introduced by Fine and Reid in the study of plurigenera of toric hypersurfaces, the Fine interior of a lattice polytope got recently into the focus of research. It is has been used for constructing canonical models in the sense…

Combinatorics · Mathematics 2023-02-09 Sofía Garzón Mora , Christian Haase

Let $X$ be the family of hypersurfaces in the odd-dimensional torus ${\mathbb T}^{2n+1}$ defined by a Laurent polynomial $f$ with fixed exponents and variable coefficients. We show that if $n\Delta$, the dilation of the Newton polytope…

Algebraic Geometry · Mathematics 2018-06-28 Alan Adolphson , Steven Sperber

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

We give a local Euler-Maclaurin formula for rational convex polytopes in a rational euclidean space . For every affine rational polyhedral cone C in a rational euclidean space W, we construct a differential operator of infinite order D(C)…

Combinatorics · Mathematics 2016-08-16 Nicole Berline , Michèle Vergne

In the previous work, we study the moment polytope of the closure of the complex subtorus orbit in a symplectic toric manifold associated to an affine subspace when the closure is a smooth complex submanifold. In this paper, we clarify the…

Symplectic Geometry · Mathematics 2026-05-07 Kentaro Yamaguchi

We prove that a rational pseudointegral triangle with exactly one lattice point in its interior has at most $9$ lattice points on its boundary, where a polygon $P$ is called pseudointegral if the Ehrhart function of $P$ is a polynomial. We…

Combinatorics · Mathematics 2025-01-14 Tyrrell B. McAllister , Jason S. Williford

A lattice Delaunay polytope is known as perfect if the only ellipsoid, that can be circumscribed about it, is its Delaunay sphere. Perfect Delaunay polytopes are in one-to-one correspondence with arithmetic equivalence classes of positive…

Metric Geometry · Mathematics 2007-05-23 Mathieu Dutour , Robert Erdahl , Konstantin Rybnikov

Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…

Metric Geometry · Mathematics 2025-04-25 Srinivas Arun , Travis Dillon

Let Delta be an integral convex polytope containing the origin of dimension n in the n-dim real space and it is simplicial at all origin-less facets. Let A(Delta) be the space of all Laurent polynomials f parametered by its coefficients…

Number Theory · Mathematics 2012-11-28 Hui June Zhu

We propose a conjecture regarding the integrally closedness of lattice polytopes with large lattice lengths. We demonstrate that a lattice simplex in dimension 3 (resp. 4) with lattice length of at least 2 (resp. 3 and no edge has lattice…

Algebraic Geometry · Mathematics 2024-12-17 Lei Song , Huanqi Wen , Zhixian Zhu

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

Combinatorics · Mathematics 2007-05-23 Matthias Beck
‹ Prev 1 2 3 10 Next ›