arXiv subjects
Publications and source records attributed to Ji Hoon Chun.
We study the problem of covering a given point set in the plane by unit disks so that each point is covered exactly once. We prove that 17 points can always be exactly covered. On the other hand, we construct a set of 657 points where an exact cover is not possible.
The Sausage Catastrophe of J. Wills (1983) is the observation that in $d=3$ and $d=4$, the densest packing of $n$ spheres in $\mathbb{R}^{d}$ is a sausage for small values of $n$ and jumps to a full-dimensional packing for large $n$ without passing through any intermediate dimensions. Let $n_{d}^{*}$ be the smallest value of $n$ for which the densest packing of $n$ spheres in $\mathbb{R}^{d}$ is full-dimensional and $N_{d}^{*}$ be the smallest value of $N$ for which the densest packing of $N$ spheres in $\mathbb{R}^{d}$ is full-dimensional for all $N\geq N_{d}^{*}$. We extend the work of Gandini and Zucco (1992) to obtain new upper bounds of $n_{4}^{*}\leq338,\!196$ and $N_{4}^{*}\leq516,\!946$. Some lengthy and repetitive components of the proof of the latter result were obtained using interval arithmetic.
The problem of finding the largest number of points in the unit cross-polytope such that the $l_{1}$-distance between any two distinct points is at least $2r$ is investigated for $r\in\left(1-\frac{1}{n},1\right]$ in dimensions $\geq2$ and for $r\in\left(\frac{1}{2},1\right]$ in dimension $3$. For the $n$-dimensional cross-polytope, $2n$ points can be placed when $r\in\left(1-\frac{1}{n},1\right]$. For the three-dimensional cross-polytope, $10$ and $12$ points can be placed if and only if $r\in\left(\frac{3}{5},\frac{2}{3}\right]$ and $r\in\left(\frac{4}{7},\frac{3}{5}\right]$ respectively, and no more than $14$ points can be placed when $r\in\left(\frac{1}{2},\frac{4}{7}\right]$. Also, constructive arrangements of points that attain the upper bounds of $2n$, $10$, and $12$ are provided, as well as $13$ points for dimension $3$ when $r\in\left(\frac{1}{2},\frac{6}{11}\right]$.