Covering spheres with spheres
Ilya Dumer
Abstract
Given a sphere of any radius r in an n-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average number of solid spheres covering a point in a bigger sphere. For a growing dimension n, we design a covering that has covering density of order (n n)/2 for the full Euclidean space or for a sphere of any radius r>1. This new upper bound reduces two times the asymptotic order of n n established in the classical Rogers bound.
Create a lesson
Related papers
The Spherical Hadwiger Theorem
Suijie Wang, Shengguo Wu
Linear isoperimetric filling inequalities in Hadamard spaces at and above the asymptotic rank
Jonas W. Peteranderl
Isometry invariant valuations on spherical polytopes
Jonas Knoerr
The Kernel Deficit Dominates Twice the Hull Deficit: A Sharp Strengthening of Nakano's Inequality
Dakota Charles Baker
In Search of Melchior's Ordinary Points
Jonathan Lenchner, Rik Sengupta
Volume and Projection Inequalities II: Determinants and Lp-Sums
Matthieu Fradelizi, Auttawich Manui, Cheikh Saliou Ndiaye et al.