Related papers: Small kissing polytopes

We study "distance spheres": the set of points lying at constant distance from a fixed arbitrary subset $K$ of $[0,1]^d$. We show that, away from the regions where $K$ is "too dense" and a set of small volume, we can decompose $[0,1]^d$…

Let $g(k)$ be the maximum size of a planar set that determines at most $k$ distances. We prove $$\frac{\pi}{3\,C(\Lambda_{hex})}\ k\sqrt{\log k} (1+o(1)) \le g(k) \le C k\log k,$$ so $g(k) \asymp k\sqrt{\log k}$ with an explicit constant…

Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp…

Let $\mathcal{S}$ be a finite set of integer points in $\mathbb{R}^d$, which we assume has many symmetries, and let $P\in\mathbb{R}^d$ be a fixed point. We calculate the distances from $P$ to the points in $\mathcal{S}$ and compare the…

We work with the following expression for the entropy (density) of a dimer gas on an infinite r-regular lattice lambda(p) = 1/2 [ pln(r)-ln(p)-2(1-p)ln(1-p)-p ]+sum_{k=2}(d_k)(p^k) where the indicated sum converges for density, p, small…

We investigate the following problem: what is the smallest possible distance between a cubic irrational $\xi$ and a rational number $p/q$ in terms of the height $H(\xi)$ and $q$? More precisely, we consider the set $D_{3,1}$ consisting of…

In (the surface of) a convex polytope P^n in R^n+1, for small prescribed volume, geodesic balls about some vertex minimize perimeter. This revision corrects a mistake in the mass bound argument in the proof of Theorem 3.8.

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

We investigate in this paper the relation between Apollonian $d$-ball packings and stacked $(d+1)$-polytopes for dimension $d\ge 3$. For $d=3$, the relation is fully described: we prove that the $1$-skeleton of a stacked $4$-polytope is the…

We consider the two-dimensional Coulomb gas with a general potential at the determinantal temperature, or equivalently, the eigenvalues of random normal matrices. We prove that the smallest gaps between particles are typically of order…

Let $\mu_{\text{2n}}(d,v)$ (respectively, $\mu^{\text{s}}_{\text{2n}}(d,v)$) be the minimal number of facets of a (simplicial) 2-neighborly $d$-polytope with $v$ vertices, $v > d \ge 4$. It is known that $\mu_{\text{2n}}(4,v) = v (v-3)/2$,…

The isotropic constant $L_K$ is an affine-invariant measure of the spread of a convex body $K$. For a $d$-dimensional convex body $K$, $L_K$ can be defined by $L_K^{2d} = \det(A(K))/(\mathrm{vol}(K))^2$, where $A(K)$ is the covariance…

We prove the following sparse approximation result for polytopes. Assume that $Q$ is a polytope in John's position. Then there exist at most $2d$ vertices of $Q$ whose convex hull $Q'$ satisfies $Q \subseteq - 2d^2 \, Q'$. As a consequence,…

We extend the results of Bey, Hen, and Wills (http://arxiv.org/abs/math/0606089). In this paper, we show that, up to equivalence under unimodular transformations, there is exactly one class of $d$-simplices having $k \ge 1$ interior lattice…

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…

Function field lattices are an interesting example of algebraically constructed lattices. Their minimum distance is bounded below by a function of the gonality of the underlying function field. Known explicit examples--coming mostly from…

A convex body $R$ in $\mathbb R^d$ is called reduced if the minimal width $\Delta(R')$ of each convex body $R'\subset R$ different from $R$ is strictly smaller than the minimal width $\Delta(R)$ of $R$. In this article we construct a…

A $(k,g)$-cage is a $k$-regular simple graph of girth $g$ with minimum possible number of vertices. In this paper, $(k,g)$-cages which are Moore graphs are referred as minimal $(k,g)$-cages. A simple connected graph is called distance…

Various packing problems and simulations of hard and soft interacting particles, such as microscopic models of nematic liquid crystals, reduce to calculations of intersections and pair interactions between ellipsoids. When constrained to a…