English
Related papers

Related papers: Lattice polytopes of degree 2

200 papers

In 1996 I.Kh. Sabitov proved that the volume of a simplicial polyhedron in a 3-dimensional Euclidean space is a root of certain polynomial with coefficients depending on the combinatorial type and on edge lengths of the polyhedron only.…

Metric Geometry · Mathematics 2014-05-20 Alexander A. Gaifullin

Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…

Classical Analysis and ODEs · Mathematics 2025-09-25 Sigrid Grepstad , Mihail N. Kolountzakis , Emmanuil Spyridakis

Given a knot in 3-space, one can associate a sequence of Laurrent polynomials, whose $n$th term is the $n$th colored Jones polynomial. The Generalized Volume Conjecture states that the value of the $n$-th colored Jones polynomial at $\exp(2…

Geometric Topology · Mathematics 2007-05-23 Stavros Garoufalidis , Thang TQ Le

The intrinsic volumes of Gaussian polytopes are considered. A lower variance bound for these quantities is proved, showing that, under suitable normalization, the variances converge to strictly positive limits. The implications of this…

Probability · Mathematics 2017-11-06 Imre Bárány , Christoph Thaele

We use the residue theorem to derive an expression for the number of lattice oints in a dilated n-dimensional tetrahedron with vertices at lattice points on each coordinate axis and the origin. This expression is known as the Ehrhart…

Combinatorics · Mathematics 2007-05-23 Matthias Beck

We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$…

Number Theory · Mathematics 2017-07-12 Randell Heyman

We state the Central Limit Theorem, as the degree goes to infinity, for the normalized volume of the zero set of a rectangular Kostlan-Shub-Smale random polynomial system. This paper is a continuation of {\it Central Limit Theorem for the…

Probability · Mathematics 2021-09-27 Jean-Marc Azaïs , Diego Armentano , Federico Dalmao , José R. León

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

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

One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice…

Combinatorics · Mathematics 2016-03-09 Bernardo González Merino , Matthias Henze

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

Combinatorics · Mathematics 2009-09-24 Alan Stapledon

We confirm a conjecture of Monical, Tokcan and Yong on a characterization of the lattice points in the Newton polytopes of key polynomials.

Combinatorics · Mathematics 2019-11-19 Neil J. Y. Fan , Peter L. Guo , Simon C. Y. Peng , Sophie C. C. Sun

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

Metric Geometry · Mathematics 2007-05-23 Hartwig Bosse , Martin Groetschel , Martin Henk

The lattice size of a lattice polygon $P$ was introduced and studied by Schicho, and by Castryck and Cools in relation to the problem of bounding the total degree and the bi-degree of the defining equation of an algebraic curve. In this…

Combinatorics · Mathematics 2023-12-22 Jenya Soprunova

In the hierarchy of structural sophistication for lattice polytopes, normal polytopes mark a point of origin; very ample and Koszul polytopes occupy bottom and top spots in this hierarchy, respectively. In this paper we explore a simple…

Combinatorics · Mathematics 2016-05-10 Matthias Beck , Jessica Delgado , Joseph Gubeladze , Mateusz Michałek

We introduce Tadao Oda's famous question on lattice polytopes which was originally posed at Oberwolfach in 1997 and, although simple to state, has remained unanswered. The question is motivated by a discussion of the two-dimensional case -…

Combinatorics · Mathematics 2025-12-25 Johannes Hofscheier , Alexander Kasprzyk

We give estimates on the number $AL_H(x)$ of arithmetic lattices $\Gamma$ of covolume at most $x$ in a simple Lie group $H$. In particular, we obtain a first concrete estimate on the number of arithmetic 3-manifolds of volume at most $x$.…

Group Theory · Mathematics 2010-04-23 Mikhail Belolipetsky , Tsachik Gelander , Alex Lubotzky , Aner Shalev

We bound the hyperbolic volumes of a large class of knots and links, called homogeneously adequate knots and links, in terms of their diagrams. To do so, we use the decomposition of these links into ideal polyhedra, developed by Futer,…

Geometric Topology · Mathematics 2014-06-18 Paige Bartholomew , Shane McQuarrie , Jessica S. Purcell , Kai Weser

As shown by McMullen in 1983, the coefficients of the Ehrhart polynomial of a lattice polytope can be written as a weighted sum of facial volumes. The weights in such a local formula depend only on the outer normal cones of faces, but are…

Metric Geometry · Mathematics 2025-10-01 Maren H. Ring , Achill Schürmann

In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is…

Number Theory · Mathematics 2015-01-14 Artūras Dubickas , Min Sha