English
Related papers

Related papers: Multiples of lattice polytopes without interior la…

200 papers

We investigate the Ehrhart polynomial for the class of 0-symmetric convex lattice polytopes in Euclidean $n$-space $\mathbb{R}^n$. It turns out that the roots of the Ehrhart polynomial and Minkowski's successive minima are closely related…

Metric Geometry · Mathematics 2011-10-20 Martin Henk , Achill Schuermann , Joerg M. Wills

In this paper we study the classification problem of convex lattice ploytopes with respect to given volume or given cardinality.

Metric Geometry · Mathematics 2011-05-27 Heling Liu , Chuanming Zong

In 1980, V.I. Arnold studied the classification problem for convex lattice polygons of given area. Since then this problem and its analogues have been studied by B'ar'any, Pach, Vershik, Liu, Zong and others. Upper bounds for the numbers of…

Metric Geometry · Mathematics 2012-11-14 Chuanming Zong

The aim of this paper is to give necessary and sufficient conditions for an integral polynomial to be the characteristic polynomial of a semi-simple isometry of some even unimodular lattice of given signature. This result has applications…

Number Theory · Mathematics 2022-12-29 Eva Bayer-Fluckiger

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

Combinatorics · Mathematics 2018-11-20 Eran Nevo , Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embedded into the lattice Co(P) of all order-convex subsets of a partially ordered set P (resp., P of length at most n). We prove the following…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

Let OT_d(n) be the smallest integer N such that every N-element point sequence in R^d in general position contains an order-type homogeneous subset of size n, where a set is order-type homogeneous if all (d+1)-tuples from this set have the…

Combinatorics · Mathematics 2014-01-14 Andrew Suk

In this paper for any dimension n we give a complete list of lattice convex polytopes in R^n that are regular with respect to the group of affine transformations preserving the lattice.

Combinatorics · Mathematics 2008-12-17 Oleg Karpenkov

Let $X$ be a list of vectors that is totally unimodular. In a previous article the author proved that every real-valued function on the set of interior lattice points of the zonotope defined by $X$ can be extended to a function on the whole…

Combinatorics · Mathematics 2019-10-04 Matthias Lenz

The purpose of this paper is to study convex bodies $C$ for which there exists no convex body $C^\prime\subsetneq C$ of the same lattice width. Such bodies shall be called ``lattice reduced'', and they occur naturally in the study of the…

Metric Geometry · Mathematics 2024-07-23 Giulia Codenotti , Ansgar Freyer

A lattice Delaunay polytope D is called perfect if it has the property that there is a unique circumscribing ellipsoid with interior free of lattice points, and with the surface containing only those lattice points that are the vertices of…

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

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

Combinatorics · Mathematics 2007-05-23 David Orden , Francisco Santos

To each lattice simplex $\Delta$ we associate a poset encoding the additive structure of lattice points in the fundamental parallelepiped for $\Delta$. When this poset is an antichain, we say $\Delta$ is antichain. To each partition…

Combinatorics · Mathematics 2019-01-11 Benjamin Braun , Brian Davis

For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…

Combinatorics · Mathematics 2019-01-17 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

We show that the graph of a simplicial polytope of dimension $d \ge 3$ has no nontrivial minimum edge cut with fewer than $d(d+1)/2$ edges, hence the graph is $\min\{\delta, d(d+1)/2\}$-edge-connected where $\delta$ denotes the minimum…

Combinatorics · Mathematics 2023-11-14 Vincent Pilaud , Guillermo Pineda-Villavicencio , Julien Ugon

Let $L$ be any integral lattice in the 2-dimensional Euclidean space. Generalizing the earlier works of Hiroshi Maehara and others, we prove that for every integer $n>0$, there is a circle in the plane $\mathbb{R}^{2}$ that passes through…

Combinatorics · Mathematics 2012-06-29 Eiichi Bannai , Tsuyoshi Miezaki

Let $\delta_0(P,k)$ denote the degree $k$ dilation of a point set $P$ in the domain of plane geometric spanners. If $\Lambda$ is the infinite square lattice, it is shown that $1+\sqrt{2} \leq \delta_0(\Lambda,3) \leq (3+2\sqrt2) \, 5^{-1/2}…

Metric Geometry · Mathematics 2016-04-25 Adrian Dumitrescu , Anirban Ghosh

A polytope $D$ whose vertices belong to a lattice of rank $d$ is Delaunay if there is a circumscribing $d$-dimensional ellipsoid, $E$, with interior free of lattice points so that the vertices of $D$ lie on $E$. If in addition, the…

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

For a complex polynomial $P$ of degree $n$ and an $m$-tuple of distinct complex numbers $\Lambda=(\lambda_1,\ldots,\lambda_m)$, the dope matrix $D_P(\Lambda)$ is defined as the $m \times (n+1)$ matrix $(c)_{ij}$ with $c_{ij} =1$ if…

Combinatorics · Mathematics 2024-02-21 Ankit Bisain

We show that there exist absolute constants $\Delta > \delta > 0$ such that, for all $n \geqslant 2$, there exists a polynomial $P$ of degree $n$, with $\pm 1$ coefficients, such that $$\delta\sqrt{n} \leqslant |P(z)| \leqslant…

Classical Analysis and ODEs · Mathematics 2019-07-23 Paul Balister , Béla Bollobás , Robert Morris , Julian Sahasrabudhe , Marius Tiba