Related papers: Delaunay polytopes derived from the Leech lattice

In this paper, we provide a simple criterion for the Schubitope $\mathcal{S}_{D}$ associated to a diagram $D$ to be lattice-free. We further show that $\mathcal{S}_{D}$ is lattice-free if and only if its Ehrhart polynomial is equal to the…

In this paper, we shall give a new upper diameter estimate for complete Riemannian manifolds in the case that the Bakry-\'Emery Ricci curvature has a positive lower bound and the norm of the potential function has an upper bound. Our…

The Monotone Upper Bound Problem (Klee, 1965) asks if the number M(d,n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d,n) = M_{ubt}(d,n), the maximal…

Given a lattice $L$ in the plane, we define the affiliated deep hole lattice $H(L)$ to be spanned by a shortest vector of $L$ and a deep hole of $L$ contained in the triangle with sides corresponding to the shortest basis vectors. We study…

Well-rounded lattices have been a topic of recent studies with applications in wiretap channels and in cryptography. A lattice of full rank in Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. In…

Let $\| \cdot \|$ be the euclidean norm on ${\bf R}^n$ and $\gamma_n$ the (standard) Gaussian measure on ${\bf R}^n$ with density $(2 \pi )^{-n/2} e^{- \| x\|^2 /2}$. Let $\vartheta$ ($ \simeq 1.3489795$) be defined by $\gamma_1 ([ -…

The linear extension diameter of a finite poset P is the maximum distance between a pair of linear extensions of P, where the distance between two linear extensions is the number of pairs of elements of P appearing in different orders in…

The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increasing edge-path on a simple d-polytope with n facets. More specifically, it asks whether the upper bound M(d,n)<=M_{ubt}(d,n) provided by…

For any Wulff shape $\mathcal{W}$, its dual Wulff shape and spherical Wulff shape $\widetilde{\mathcal{W}}$ can be defined naturally. A self-dual Wulff shape is a Wulff shape equaling its dual Wulff shape exactly. In this paper, we show…

A classical result of R.\,P. Dilworth states that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice~$L$. A~sharper form was published in G.~Gr\"atzer and E.\,T. Schmidt in 1962, adding…

The $k$-tiling problem for a convex polytope $P$ is the problem of covering $\mathbb R^d$ with translates of $P$ using a discrete multiset $\Lambda$ of translation vectors, such that every point in $\mathbb R^d$ is covered exactly $k$…

We show there is an uncountable number of parallel total perfect codes in the integer lattice graph ${\Lambda}$ of $\R^2$. In contrast, there is just one 1-perfect code in ${\Lambda}$ and one total perfect code in ${\Lambda}$ restricting to…

We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…

Let $P$ be a rational polyhedron in $\mathbb{R}^d$ and let $\mathcal{L}$ be a class of $d$-dimensional maximal lattice-free rational polyhedra in $\mathbb{R}^d$. For $L \in \mathcal{L}$ by $R_L(P)$ we denote the convex hull of points…

Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic…

In 1960, G. Gr\"atzer and E.\,T. Schmidt proved that every finite distributive lattice can be represented as the congruence lattice of a sectionally complemented finite lattice $L$. For $u \leq v$ in $L$, they constructed a sectional…

This paper introduces path triangulation of points in a bounded, simply connected surface region, replacing ordinary triangles in a Delaunay triangulation with path triangles from homotopy theory. A {\bf path triangle} has a border that is…

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…

A convex body is unconditional if it is symmetric with respect to reflections in all coordinate hyperplanes. In this paper, we investigate unconditional lattice polytopes with respect to geometric, combinatorial, and algebraic properties.…

Let (M, g) be a complete Riemannian manifold. Assume that the Ricci curvature of M has quadratic decay and that the volume growth is strictly faster than quadratic. We establish that the Hardy spaces of exact 1-differential forms on M ,…