Semidefinite programming in combinatorial optimization with applications to coding theory and geometry
We apply the semidefinite programming method to obtain a new upper bound on the cardinality of codes made of subspaces of a linear vector space over a finite field. Such codes are of interest in network coding.Next, with the same method, we prove an upper bound on the cardinality of sets avoiding on...
| Main Author: | |
|---|---|
| Language: | ENG |
| Published: |
Université Sciences et Technologies - Bordeaux I
2013
|
| Subjects: | |
| Online Access: | http://tel.archives-ouvertes.fr/tel-00948055 http://tel.archives-ouvertes.fr/docs/00/94/80/55/PDF/PASSUELLO_ALBERTO_2013.pdf |
| Summary: | We apply the semidefinite programming method to obtain a new upper bound on the cardinality of codes made of subspaces of a linear vector space over a finite field. Such codes are of interest in network coding.Next, with the same method, we prove an upper bound on the cardinality of sets avoiding one distance in the Johnson space, which is essentially Schrijver semidefinite program. This bound is used to improve existing results on the measurable chromatic number of the Euclidean space.We build a new hierarchy of semidefinite programs whose optimal values give upper bounds on the independence number of a graph. This hierarchy is based on matrices arising from simplicial complexes. We show some properties that our hierarchy shares with other classical ones. As an example, we show its application to the problem of determining the independence number of Paley graphs. |
|---|