English
Related papers

Related papers: Classifying smooth lattice polytopes via toric fib…

200 papers

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

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

We give a bound of $k$ for a very ample lattice polytope to be $k$-normal. Equivalently, we give a new combinatorial bound for the Castelnuovo-Mumford regularity of normal projective toric varieties.

Algebraic Geometry · Mathematics 2018-02-06 Bach Le Tran

We prove that, for fixed n there exist only finitely many embeddings of Q-factorial toric varieties X into P^n that are induced by a complete linear system. The proof is based on a combinatorial result that for fixed nonnegative integers d…

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

We provide a complete classification up to isomorphism of all smooth convex lattice 3-polytopes with at most 16 lattice points. There exist in total 103 different polytopes meeting these criteria. Of these, 99 are strict Cayley polytopes…

Combinatorics · Mathematics 2012-06-22 Anders Lundman

Let A be an ample line bundle on a projective toric variety X of dimension n. We show that if l>=n-1+p, then A^l satisfies the property N_p. Applying similar methods, we obtain a combinatorial theorem: For a given lattice polytope P we give…

Algebraic Geometry · Mathematics 2007-05-23 Milena Hering

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

These notes are based on three lectures given at the 2013 CIME/CIRM summer school. The purpose of this series of lectures is to introduce the notion of a toric fibration and to give its geometrical and combinatorial characterizations.…

Algebraic Geometry · Mathematics 2013-11-08 Sandra Di Rocco

In 2012 Gubeladze (Adv.\ Math.\ 2012) introduced the notion of k-convex-normal polytopes to show that integral polytopes all of whose edges are longer than 4d(d+1) have the integer decomposition property. In the first part of this paper we…

Combinatorics · Mathematics 2014-10-24 Christian Haase , Jan Hofmann

We show that the following classes of lattice polytopes have unimodular covers, in dimension three: the class of parallelepipeds, the class of centrally symmetric polytopes, and the class of Cayley sums $\text{Cay}(P,Q)$ where the normal…

Combinatorics · Mathematics 2023-12-29 Giulia Codenotti , Francisco Santos

We discuss an experimental approach to open problems in toric geometry: are smooth projective toric varieties (i) projectively normal and (ii) defined by degree 2 equations? We discuss the creation of lattice polytopes defining smooth toric…

Algebraic Geometry · Mathematics 2013-01-29 Winfried Bruns

We show that lattice polytopes cut out by root systems of classical type are normal and Koszul, generalizing a well-known result of Bruns, Gubeladze, and Trung in type A. We prove similar results for Cayley sums of collections of polytopes…

Combinatorics · Mathematics 2008-12-07 Sam Payne

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

We describe an algorithm for determining whether two convex polytopes P and Q, embedded in a lattice, are isomorphic with respect to a lattice automorphism. We extend this to a method for determining if P and Q are equivalent, i.e. whether…

Combinatorics · Mathematics 2013-01-29 Roland Grinis , Alexander Kasprzyk

Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this paper we explore this correspondence to classify smooth lattice polytopes…

Algebraic Geometry · Mathematics 2013-02-08 Carolina Araujo , Douglas Monsôres

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

Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this thesis we explore this correspondence to classify smooth lattice…

Algebraic Geometry · Mathematics 2013-07-05 Douglas Monsôres

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

A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…

Combinatorics · Mathematics 2018-11-09 Gabriele Balletti
‹ Prev 1 2 3 10 Next ›