Department of Mathematics and Statistics at the Faculty of Science
University of Calgary
Optimization-based bounds for the kissing number (Part IV)
Submitted by ppaterso on Tue, 12/02/2008 - 2:13pm.
Dec 3 2008 - 1:15pm
Dec 3 2008 - 2:15pm
Speaker:
Yuriy Zinchenko
Location:
MS 490Discrete Geometry Seminar
Given an $n$-dimensional unit sphere centered at the origin,
the maximal number of unit spheres that can touch it from
the outside with no mutual overlap is called the kissing
number in dimension $n$. The problem of determining the
kissing number is fairly difficult and the exact answers are
known only for dimensions 1, 2, 3, 4, 8 and 24. Determining
the kissing number is a classical problem in geometry and
is of particular interest to coding theory relating to
the so-called spherical codes.
the maximal number of unit spheres that can touch it from
the outside with no mutual overlap is called the kissing
number in dimension $n$. The problem of determining the
kissing number is fairly difficult and the exact answers are
known only for dimensions 1, 2, 3, 4, 8 and 24. Determining
the kissing number is a classical problem in geometry and
is of particular interest to coding theory relating to
the so-called spherical codes.