The set of packing and covering densities of convex disks

Abstract

For every convex disk K (a convex compact subset of the plane, with non-void interior), the packing density δ(K) and covering density (K) form an ordered pair of real numbers, i.e., a point in R2. The set consisting of points assigned this way to all convex disks is the subject of this article. A few known inequalities on δ(K) and (K) jointly outline a relatively small convex polygon P that contains , while the exact shape of remains a mystery. Here we describe explicitly a leaf-shaped convex region contained in and occupying a good portion of P. The sets T and L of translational packing and covering densities and lattice packing and covering densities are defined similarly, restricting the allowed arrangements of K to translated copies or lattice arrangements, respectively. Due to affine invariance of the translative and lattice density functions, the sets T and L are compact. Furthermore, the sets , T and L contain the subsets , T and L respectively, corresponding to the centrally symmetric convex disks K, and our leaf is contained in each of , T and L.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…