On kappa-covering minima
math.MG
Submitted: 2026-10-28
Updated: 2026-10-28
License: http://creativecommons.org/licenses/by/4.0/
The gist: We introduce κ-covering minima by requiring the permutation simplices of one independent lattice frame to fit into translates of a common dilate of a convex body.
Abstract
We introduce κ-covering minima by requiring the permutation simplices of one independent lattice frame to fit into translates of a common dilate of a convex body. We prove a lower bound for their normalized product, with coefficient (n+1)/2 n for centrally symmetric bodies and an explicit dependence on Minkowski asymmetry in general. On Euclidean balls, the supremum over full-rank lattices of the ratio of the resulting fitting radius to the covering radius has order sqrt n. We also establish basic comparisons with classical lattice minima and bounds under products, projections, Minkowski addition, and free direct sums. We extend the definition by allowing projected periodic lattice triangulations. These extended minima agree with the classical covering minima on ellipsoids.
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