A semidefinite programming hierarchy for packing problems in discrete geometry

K. Borsuk, S. Ulam: On symmetric products of topological spaces. Bull. Amer. Math. Soc. 37, 875–882 (1931)

1931

Earlier work this paper cites.

R. Arens: Topologies for homeomorphism groups. Amer. J. Math. 68, 593–610 (1946)

1946

Earlier work this paper cites.

V.L. Klee, Jr.: Separation properties of convex cones. Proc. Amer. Math. Soc. 6, 313–318 (1955)

1955

Earlier work this paper cites.

J. Dieudonné: Sur la séparation des ensembles convexes. Math. Ann. 163, 1–3 (1966)

1966

Earlier work this paper cites.

H.S. Wilf: Hadamard determinants, Möbius functions, and the chromatic number of a graph. Bull. Amer. Math. Soc. 74, 960–964 (1968)

1968

Earlier work this paper cites.

B. Lindström: Determinants on semilattices. Proc. Amer. Math. Soc. 20, 207–208 (1969)

1969

Earlier work this paper cites.

A.J. Hoffman: On eigenvalues and colorings of graphs. In: B. Harris (ed.) Graph Theory and its Applications, pp. 79–91. Academic Press (1970)

1970

Earlier work this paper cites.

R.M. Karp: Reducibility among combinatorial problems. In: R.E. Miller, J.W. Thatcher (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)

1972

Earlier work this paper cites.

P. Delsarte, J.M. Goethals, and J.J. Seidel: Spherical codes and designs. Geom. Dedicata 6, 363–388 (1977)

1977

Earlier work this paper cites.

G.A. Kabatiansky, V.I. Levenshtein: On bounds for packings on a sphere and in space. Probl. Peredachi Inf. 14, 3–25 (1978)

1978

Earlier work this paper cites.

L. Lovász: On the Shannon capacity of a graph. IEEE Trans. Inf. Th. 25, 1–7 (1979)

1979

Earlier work this paper cites.

A. Schrijver: A comparison of the Delsarte and Lovász bounds. IEEE Trans. Inf. Th. 25, 425–429 (1979)

1979

Earlier work this paper cites.

C. Berg, J.P.R. Christensen, P. Ressel: Harmonic analysis on semigroups: theory of positive definite and related functions. Springer-Verlag (1984)

1984

Earlier work this paper cites.

L. Lovász, A. Schrijver: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1, 166–190 (1991)

1991

Cited alongside, same era.

M. Putinar: Positive polynomials on compact semi-algebraic sets. Ind. Univ. Math. J. 42, 969–984 (1993)

1993

Cited alongside, same era.

G.B. Folland: A course in abstract harmonic analysis. Studies in Advanced Mathematics, CRC Press (1995)

1995

Cited alongside, same era.

D. Handel: Some homotopy properties of spaces of finite subsets of topological spaces. Houston J. Math. 26, 747–764 (2000)

2000

Cited alongside, same era.

A. Barvinok: A Course in Convexity. Grad. Stud. Math. 54, American Mathematical Society (2002)

2002

Cited alongside, same era.

D. Gijswijt, A. Schrijver, H. Tanaka: New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. J. Comb. Theory, Ser. A 113, 1719–1731 (2006)

2006

Later among the works it cites.

M. Laurent: Strengthened semidefinite programming bounds for codes. Math. Program., Ser. B 109, 239–261 (2007)

2007

Later among the works it cites.

C. Bachoc, F. Vallentin: New upper bounds for kissing numbers from semidefinite programming. J. Amer. Math. Soc. 21, 909–924 (2008) ( http://arxiv.org/abs/math/0608426 )

2008

Later among the works it cites.

C. Bachoc, G. Nebe, F.M. de Oliveira Filho, F. Vallentin: Lower bounds for measurable chromatic numbers. Geom. Funct. Anal. 19, 645–661 (2009) ( http://arxiv.org/abs/0801.1059 )

Original

2009

Later among the works it cites.

G. Regts: Upper bounds for ternary constant weight codes from semidefinite programming and representation theory. Master thesis, University of Amsterdam (2009)