Related papers: On compact packings of the plane with circles of t…

We study universal cycles of the set ${\cal P}(n,k)$ of $k$-partitions of the set $[n]:=\{1,2,\ldots,n\}$ and prove that the transition digraph associated with ${\cal P}(n,k)$ is Eulerian. But this does not imply that universal cycles (or…

We present a self-contained proof that the number of diameter pairs among n points in Euclidean 3-space is at most 2n-2. The proof avoids the ball polytopes used in the original proofs by Grunbaum, Heppes and Straszewicz. As a corollary we…

In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…

A long-standing open conjecture of Branko Gr\"unbaum from 1972 states that any simple arrangement of $n$ pairwise intersecting pseudocircles in the plane can have at most $2n-2$ digons. Agarwal et al. proved this conjecture for arrangements…

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…

We construct a continuum of non-homeomorphic compact subspaces of the real line R without singleton components. Thus from the purely topological point of view the real line contains not only more closed sets than open sets but also more…

We prove algorithmic and hardness results for the problem of finding the largest set of a fixed diameter in the Euclidean space. In particular, we prove that if $A^*$ is the largest subset of diameter $r$ of $n$ points in the Euclidean…

An extremal $k$-packing is a collection of $k$ mutually disjoint metric discs, embedded in a surface, whose radius is maximal for the given topology. We study compact non-orientable surfaces of genus $g\ge 3$ containing extremal…

We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…

Let $(N,\Phi)$ be a circular Ferrero pair. We define the disk with center $b$ and radius $a$, $\mathcal{D}(a;b)$, as \[\mathcal{D}(a;b)=\{x\in \Phi(r)+c\mid r\neq 0,\ b\in \Phi(r)+c,\ |(\Phi(r)+c)\cap (\Phi(a)+b)|=1\}.\] We prove that in…

We study the orbit of $\mathbb{R}$ under the Bianchi group $\operatorname{PSL}_2(\mathcal{O}_K)$, where $K$ is an imaginary quadratic field. The orbit, called a Schmidt arrangement $\mathcal{S}_K$, is a geometric realisation, as an…

The $k$-coverage problem is to find the minimum number of disks such that each point in a given plane is covered by at least $k$ disks. Under unit disk condition, when $k$=1, this problem has been solved by Kershner in 1939. However, when…

The main result of this paper is an effective count for Apollonian circle packings that are either bounded or contain two parallel lines. We obtain this by proving an effective equidistribution of closed horospheres in the unit tangent…

A real form $G_0$ of a complex semisimple Lie group $G$ has only finitely many orbits in any given compact $G$-homogeneous projective algebraic manifold $Z=G/Q$. A maximal compact subgroup $K_0$ of $G_0$ has special orbits $C$ which are…

We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…

Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary…

A circle of curvature $n\in\mathbb{Z}^+$ is a part of finitely many primitive integral Apollonian circle packings. Each such packing has a circle of minimal curvature $-c\leq 0$, and we study the distribution of $c/n$ across all primitive…

In an Euclidean $d$-space, the container problem asks to pack $n$ equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and $d\geq 2$ we show that solutions to the container problem can…

Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…

We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…