Graph Coverings, Quantum Entanglement, and Invariant Theory
Oleg R. Musin
University of Texas at Brownsville
Friday, April 9, 12:00 PM, EMS E495A
The kissing number k(n) is the maximal number of equal nonoverlapping spheres in n-dimensional space that can touch another sphere of the same size. This problem in dimension three was the subject of a famous discussion between Isaac Newton and David Gregory in 1694. In three dimensions the problem was finally solved only in 1953 by Schütte and van der Waerden. It was proved that the bounds given by Delsarte's method are not good enough to solve the problem in 4-dimensional space. Delsarte's linear programming method is widely used in coding theory. In this talk we will discuss a solution of the kissing problem in four dimensions which is based on an extension of the Delsarte method. This extension also yields a new proof of k(3)<13. We are also going to discuss the maximal cardinalities of spherical two-distance sets. Using the so-called polynomial method and Delsarte's method these cardinalities can be determined for all dimensions n<40.
Refreshments will be served in EMS E495B at 11:30 am.
All Colloquia and Seminars