A Lower Bound on the Density of Sphere Packings via Graph Theory

Details A Lower Bound on the Density of Sphere Packings via Graph Theory A Lower Bound on the Density of Sphere Packings via Graph Theory

2004-02-09

arxiv.org/abs/math/0402132v1

Mathematics

Combinatorics

6 pages, 2 postscript figures

Scientific paper

Using graph-theoretic methods we give a new proof that for all sufficiently large $n$, there exist sphere packings in $\R^n$ of density at least $cn2^{-n}$, exceeding the classical Minkowski bound by a factor linear in $n$. This matches up to a constant the best known lower bounds on the density of sphere packings due to Rogers, Davenport-Rogers, and Ball. The suggested method makes it possible to describe the points of such a packing with complexity $\exp(n\log n)$, which is significantly lower than in the other approaches.

Affiliated with

Also associated with

No associations

Rating

A Lower Bound on the Density of Sphere Packings via Graph Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Lower Bound on the Density of Sphere Packings via Graph Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Lower Bound on the Density of Sphere Packings via Graph Theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-30350