English
Related papers

Related papers: Delaunay polytopes derived from the Leech lattice

200 papers

It was proved by Nill that for any lattice simplex of dimension $d$ with degree $s$ which is not a lattice pyramid, the inequality $d+1 \leq 4s-1$ holds. In this paper, we give a complete characterization of lattice simplices satisfying the…

Combinatorics · Mathematics 2017-04-06 Akihiro Higashitani

We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…

Rings and Algebras · Mathematics 2007-05-23 Martin Goldstern , Miroslav Ploscica

Given lattice polytopes $P_1, \ldots, P_k$ contained in a $k$-dimensional subspace $U \subseteq \mathbb{R}^d$ and a $d$-dimensional lattice polytope $Q \subset \mathbb{R}^d$, we compute the Hodge vector of the Cayley polytope $P_1 * \cdots…

Combinatorics · Mathematics 2026-02-25 Vadym Kurylenko , Benjamin Nill

Reflexive polytopes form one of the distinguished classes of lattice polytopes. Especially reflexive polytopes which possess the integer decomposition property are of interest. In the present paper, by virtue of the algebraic technique on…

Combinatorics · Mathematics 2020-09-08 Takayuki Hibi , Akiyoshi Tsuchiya

Let k be a field of positive characteristic. We construct, for each dominant coweight \lambda of the standard maximal torus in the special linear group, a closed subvariety D(\lambda) of the multigraded Hilbert scheme of an affine space…

Algebraic Geometry · Mathematics 2010-10-05 Martin Kreidl

We prove that in any dimension $n$ there exists an origin-symmetric ellipsoid ${\mathcal{E}} \subset {\mathbb{R}}^n$ of volume $ c n^2 $ that contains no points of ${\mathbb{Z}}^n$ other than the origin, where $c > 0$ is a universal…

Metric Geometry · Mathematics 2026-01-27 Boaz Klartag

We prove new $\ell ^{p} (\mathbb Z ^{d})$ bounds for discrete spherical averages in dimensions $ d \geq 5$. We focus on the case of lacunary radii, first for general lacunary radii, and then for certain kinds of highly composite choices of…

Classical Analysis and ODEs · Mathematics 2021-12-21 Robert Kesler , Michael T. Lacey , Dario Mena

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

For a given point set $S$ in a plane, we develop a distributed algorithm to compute the $\alpha-$shape of $S$. $\alpha-$shapes are well known geometric objects which generalize the idea of a convex hull, and provide a good definition for…

Computational Geometry · Computer Science 2013-02-19 Harish Chintakunta , Hamid Krim

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

We construct a completely normal bounded distributive lattice D in which for every pair (a, b) of elements, the set {x $\in$ D | a $\le$ b $\lor$ x} has a countable coinitial subset, such that D does not carry any binary operation -…

Rings and Algebras · Mathematics 2019-05-15 Friedrich Wehrung

We present an algorithm for producing Delaunay triangulations of manifolds. The algorithm can accommodate abstract manifolds that are not presented as submanifolds of Euclidean space. Given a set of sample points and an atlas on a compact…

Computational Geometry · Computer Science 2015-05-07 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh

We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…

Numerical Analysis · Mathematics 2021-07-07 Thomas Mejstrik , Vladimir Yu. Protasov

We completely classify non-spanning $3$-polytopes, by which we mean lattice $3$-polytopes whose lattice points do not affinely span the lattice. We show that, except for six small polytopes (all having between five and eight lattice…

Combinatorics · Mathematics 2018-10-02 Mónica Blanco , Francisco Santos

The convex hull of the roots of a classical root lattice is called a root polytope. We determine explicit unimodular triangulations of the boundaries of the root polytopes associated to the root lattices A_n, C_n, and D_n, and compute their…

Combinatorics · Mathematics 2013-10-07 Federico Ardila , Matthias Beck , Serkan Hosten , Julian Pfeifle , Kim Seashore

The lattice diameter of a bounded set $S \subset \mathbb{R}^d$ measures the maximal number of lattice points in a segment whose endpoints are lattice points in $S$. Such a segment is called a lattice diameter segment of $S$. This simple…

Combinatorics · Mathematics 2025-08-29 Anouk E. Brose , Jesús A. De Loera , Gyivan Lopez-Campos , Antonio J. Torres

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

In Euclidean 3-space endowed with a Cartesian reference system we consider a class of surfaces, called Delaunay tori, constructed by bending segments of Delaunay cylinders with neck-size $a$ and $n$ lobes along circumferences centered at…

Analysis of PDEs · Mathematics 2020-11-19 Paolo Caldiroli , Alessandro Iacopetti , Monica Musso

We study the set of square-free parts of volume polynomials associated with four planar lattice polytopes. This is motivated by the problem of describing possible pairwise intersection numbers of four curves in $(\mathbb{C}^*)^2$ with…

Combinatorics · Mathematics 2026-02-19 Darren Gerrity , Ivan Soprunov

The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…

Number Theory · Mathematics 2018-06-05 Bence Borda