Related papers: Perfect Delaunay Polytopes and Perfect Quadratic F…
Dilworth's theorem. Every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice $L$. We want: Every finite distributive lattice $D$ can be represented as the congruence lattice of a nice finite…
A Delaunay decomposition is a cell decomposition in R^d for which each cell is inscribed in a Euclidean ball which is empty of all other vertices. This article introduces a generalization of the Delaunay decomposition in which the Euclidean…
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…
Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay triangulation. The technique has been researched extensively for full dimensional triangulations of point sets. However, an important case of…
A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
The perfect cone compactification is a toroidal compactification which can be defined for locally symmetric varieties. Let $\overline{D_{L}/\widetilde{O}^{+}(L)}^{p}$ be the perfect cone compactification of the quotient of the type IV…
The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (e.g., $\{0\})$ that are closed under the natural metric, but has no prime ideals closed under that metric; hence closed…
We prove that in each dimension $d$ there is a constant $w^\infty(d)\in \mathbb{N}$ such that for every $n\in \mathbb{N}$ all but finitely many $d$-polytopes with $n$ lattice points have width at most $w^\infty(d)$. We call $w^\infty(d)$…
We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…
We call the $\delta$-vector of an integral convex polytope of dimension $d$ flat if the $\delta$-vector is of the form $(1,0,\ldots,0,a,\ldots,a,0,\ldots,0)$, where $a \geq 1$. In this paper, we give the complete characterization of…
The Lasserre's reconstruction algorithm is extended to the D-polytopes with the construction of their shape space. Thus, the areas of d-skeletons $(1\leq d\leq D)$ can be expressed as functions of the areas and normal bi-vectors of the…
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…
A $d$-dimensional closed convex set $K$ in $\mathbb{R}^d$ is said to be lattice-free if the interior of $K$ is disjoint with $\mathbb{Z}^d$. We consider the following two families of lattice-free polytopes: the family $\mathcal{L}^d$ of…
A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. Such cuboids are not yet discovered and their non-existence is also not proved. Perfect Euler cuboids…
We classify lattice $3$-polytopes of width larger than one and with exactly $6$ lattice points. We show that there are $74$ polytopes of width $2$, two polytopes of width $3$, and none of larger width. We give explicit coordinates for…
For d-dimensional irrational ellipsoids E with d >= 9 we show that the number of lattice points in rE is approximated by the volume of rE, as r tends to infinity, up to an error of order o(r^{d-2}). The estimate refines an earlier authors'…
We are interested in algebraic properties of empty lattice simplices $\Delta$, that is, $d$-dimensional lattice polytopes containing exactly $d+1$ points of the integer lattice $\mathbb{Z}^d$. The cyclicity rank of $\Delta$ is the minimal…
The paper is devoted to perfect and almost perfect homogeneous polytopes in Euclidean spaces. We classified perfect and almost perfect polytopes among all regular polytopes and all semiregular polytopes excepting Archimedean solids and two…