Lower bounds for measurable chromatic numbers
arXiv:0801.1059 · doi:10.1007/s00039-009-0013-7
Abstract
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 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.
18 pages, (v3) Section 8 revised and some corrections, to appear in Geometric and Functional Analysis
References in corpus (1)
Cited by in corpus (14)
- Optimal simplices and codes in projective spaces
- Invariant semidefinite programs
- A semidefinite programming hierarchy for packing problems in discrete geometry
- Spectral bounds for the independence ratio and the chromatic number of an operator
- -point semidefinite programming bounds for equiangular lines
- Complete positivity and distance-avoiding sets
- Computing upper bounds for the packing density of congruent copies of a convex body
- A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces
- Coloring the Voronoi tessellation of lattices
- A copositive formulation for the stability number of infinite graphs
- Lower bounds for the measurable chromatic number of the hyperbolic plane
- An Axiomatic Duality Framework for the Theta Body and Related Convex Corners
- A semidefinite programming hierarchy for covering problems in discrete geometry
- A recursive Lovász theta number for simplex-avoiding sets