Related papers: Flat simplices and kissing polytopes
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…
We discuss the hard-hexagon and hard-square problems, as well as the corresponding problem on the honeycomb lattice. The case when the activity is unity is of interest to combinatorialists, being the problem of counting binary matrices with…
We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…
We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…
We extend White's classification of empty tetrahedra to the complete classification of lattice $3$-polytopes with five lattice points, showing that, apart from infinitely many of width one, there are exactly nine equivalence classes of them…
We propose a conjecture regarding the integrally closedness of lattice polytopes with large lattice lengths. We demonstrate that a lattice simplex in dimension 3 (resp. 4) with lattice length of at least 2 (resp. 3 and no edge has lattice…
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…
Let $\mu$ be a probability distribution on $\mathbb{R}^d$ which assigns measure zero to every hyperplane and $S$ a set of points sampled independently from $\mu$. What can be said about the expected combinatorial structure of the convex…
It is possible for a combinatorial type of polytope to have both decomposable and indecomposable realizations; here decomposability is meant with respect to Minkowski addition. Such polytopes are called conditionally decomposable. We show…
We prove that the kissing numbers in 17, 18, 19, 20, and 21 dimensions are at least 5730, 7654, 11692, 19448, and 29768, respectively. The previous records were set by Leech in 1967, and we improve on them by 384, 256, 1024, 2048, and 2048.…
We use the automorphism group $Aut(H)$, of holes in the lattice $L_8=A_2\oplus A_2\oplus D_4$, as the starting point in the construction of sphere packings in 10 and 12 dimensions. A second lattice, $L_4=A_2\oplus A_2$, enters the…
We consider the problem of determining the length of the shortest paths between points on the surfaces of tetrahedra and cubes. Our approach parallels the concept of Alexandrov's star unfolding but focuses on specific polyhedra and uses…
We provide a local theory for the optimization of the Hausdorff distance between a polytope and a zonotope. To do this, we compute explicit local formulae for the Hausdorff function $d(P, -) : Z_n \to \mathbb{R}$, where $P$ is a fixed…
This paper deals with the three types of regular polytopes which exist in all dimensions -- regular simplices, cubes and regular cross-polytopes -- and their outer and inner radii. While the inner radii of regular simplices are well…
Let $K$ be a convex body in $\mathbb{R}^n$, let $L$ be a lattice with covolume one, and let $\eta>0$. We say that $K$ and $L$ form an $\eta$-smooth cover if each point $x \in \mathbb{R}^n$ is covered by $(1 \pm \eta) vol(K)$ translates of…
Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…
We present a family of complete acyclic Morse matchings on the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. In a future paper we will utilize these…
The Hubbard model is a paradigmatic model of strongly correlated quantum matter, thus making it desirable to investigate with quantum simulators such as ultracold atomic gases. Here, we consider the problem of two atoms interacting in a…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
In this paper, we study dilation of cyclic polytopes with the vertices defined by a generator of the simplest cubic fields. In particular, for a specific range of values, we give a precise number of the contained lattice points.