Lower bounds for measurable chromatic numbers
The Lovasz theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of distance graphs on compact metric spaces. In particular we consider distance graphs on the unit sphere. There we transform the original infinite semidefinite program into an infinite, two-variable linear program which then turns out to be an extremal question about Jacobi polynomials which we solve explicitly in the limit. As an application we derive new lower bounds for the measurable chromatic number of the Euclidean space in dimensions 10,..., 24, and we give a new proof that it grows exponentially with the dimension.
|Keywords||Nelson-Hadwiger problem, measurable chromatic number, semidefinite programming, orthogonal polynomials, spherical codes|
|MSC||ErdÃ s problems and related topics of discrete geometry (msc 52C10), dimensions (msc 52C17), Semidefinite programming (msc 90C22)|
|THEME||Logistics (theme 3)|
|Publisher||Cornell University Library|
|Series||arXiv.org e-Print archive|
|Project||Semidefinite programming and combinatorial optimization , Spinoza prijs Lex Schrijver|
Bachoc, C, Nebe, G, de Oliveira Filho, F.M, & Vallentin, F. (2008). Lower bounds for measurable chromatic numbers. arXiv.org e-Print archive. Cornell University Library .