SAUSAGES ARE GOOD PACKINGS

Citation
U. Betke et al., SAUSAGES ARE GOOD PACKINGS, Discrete & computational geometry, 13(3-4), 1995, pp. 297-311
Citations number
18
Categorie Soggetti
Computer Sciences, Special Topics","Mathematics, General","Computer Science Theory & Methods",Mathematics
ISSN journal
01795376
Volume
13
Issue
3-4
Year of publication
1995
Pages
297 - 311
Database
ISI
SICI code
0179-5376(1995)13:3-4<297:SAGP>2.0.ZU;2-W
Abstract
Let B-d be the d-dimensional unit ball and, for an integer n, let C-n = {x(1), ..., x(n)} be a packing set for B-d, i.e., \x(i) - x(j)\ grea ter than or equal to 2, 1 less than or equal to i < j less than or equ al to n. We show that for every rho < root 2 a dimension d(rho) exists such that, for d greater than or equal to d(rho), V(conv(C-n) + rho B -d) greater than or equal to V(conv(S-n) + rho B-d), where S-n is a '' sausage'' arrangement of n balls, holds. This gives considerable impro vement to Fejes Toth's ''sausage'' conjecture in high dimensions. Furt her, we prove that, for every convex body K and rho < 1/32d(-2), V(con v(C-n) + rho K) greater than or equal to V(conv(S-n) + rho K), where C -n is a packing set with respect to K and S-n is a minimal ''sausage'' arrangement of K, holds.