Non-separable arrangements of convex bodies revisited
math.MG
Submitted: 2025-12-29
Updated: 2026-10-26
Comments: 19 pages, 3 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: A problem posed by Erdős in 1945 initiated the study of non-separable arrangements of convex bodies.
Terminology
Abstract
A problem posed by Erdős in 1945 initiated the study of non-separable arrangements of convex bodies. A finite collection of convex bodies in Euclidean d-space is called a non-separable family (or NS-family) if every hyperplane intersecting their convex hull also intersects at least one member of the family. Recent work has focused on minimal coverings of NS-families consisting of positive homothetic convex bodies. In this paper, we strengthen these results by establishing their stability analogues and analyze weakly non-separable families of convex polytopes. We also examine weakly k-impassable families of convex d-polytopes for 0<k<d-1 and study tightness of NS-lattice arrangements.
Related papers
- Axis-parallel square packing with an exact formula for optimal packing of seven squares
- The microscopic weighting on a metric space
- Unrectifiable surfaces with intrinsic regularity in Carnot groups
- Monge's transport problem in synthetic Lorentzian spacetimes
- The packing spectrum: interpolation between Hausdorff and packing dimensions
- Quasiconformal uniformization and extension for planar trees