A New Packing Density Bound in 3-Space

It is shown that every compactconvex set K which is centrally symmetric and has a non-empty interior admits a lattice packingof Euclidean 3-space with density greater than or equal to0.53835.... This is an improvement of the result in [8], which achieved a bound of0.46421.... Minkowski combinations and the Brunn-Minkowski inequality are used inconjunction with the construction in [8] to achieve a better result.