Fetching the paper…
Reading the bibliography…
In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry.
G. Szegö, Orthogonal polynomials
1939
Earlier work this paper cites.
S. Bochner, Hilbert distances and positive definite functions
1941
Earlier work this paper cites.
I.J. Schoenberg, Positive definite functions on spheres
1942
Earlier work this paper cites.
H.G. Wang, Two-point homogeneous spaces
1952
Earlier work this paper cites.
K. Zarankiewicz, On a problem of P. Turán concerning graphs
1954
Earlier work this paper cites.
R.J. Duffin, Infinite Programs
1956
Earlier work this paper cites.
D.J. Kleitman, The crossing number of K 5 , n K_{5,n}
1970
Earlier work this paper cites.
P. Delsarte, An algebraic approach to the association schemes of coding theory
1973
Earlier work this paper cites.
A.T. James, A.G. Constantine, Generalized Jacobi polynomials as spherical functions of the Grassmann manifold
1974
Earlier work this paper cites.
R. Askey, Orthogonal polynomials and special functions
1975
Earlier work this paper cites.
P. Delsarte, J. M. Goethals, Alternating bilinear forms over G F ( q ) GF(q)
1975
Earlier work this paper cites.
C.F. Dunkl, A Krawtchouk polynomial addition theorem and wreath product of symmetric groups
1976
Earlier work this paper cites.
P. Delsarte, J.M. Goethals, J.J. Seidel, Spherical codes and designs
1977
Earlier work this paper cites.
F.J. MacWilliams, N.J.A. Sloane, The theory of error-correcting codes
1977
Earlier work this paper cites.
P. Delsarte, Hahn polynomials, discrete harmonics and t t -designs
1978
Earlier work this paper cites.
P. Delsarte, Bilinear forms over a finite field, with applications to coding theory
1978
Earlier work this paper cites.
G.A. Kabatiansky, V.I. Levenshtein, Bounds for packings on a sphere and in space
1978
Earlier work this paper cites.
R.J. McEliece, E.R. Rodemich and H.C. Rumsey, Jr, The Lovász bound and some generalizations
1978
Earlier work this paper cites.
E. de Klerk, D.V. Pasechnik, A note on the stability number of an orthogonality graph
1979
Earlier work this paper cites.
L. Lovász, On the Shannon capacity of a graph
1979
Earlier work this paper cites.
A.M. Odlyzko, N.J.A. Sloane, New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
1979
Earlier work this paper cites.
A. Schrijver, Association schemes and the Shannon capacity: Eberlein polynomials and the Erdős-Ko-Rado theorem
1981
Earlier work this paper cites.
J. Astola, The Lee-scheme and bounds for Lee-codes
1982
Earlier work this paper cites.
E. Bannai, T. Ito, Algebraic combinatorics. I
1984
Earlier work this paper cites.
D. Stanton, Orthogonal polynomials and Chevalley groups
1984
Earlier work this paper cites.
H. Tarnanen, M. Aaltonen, J.-M. Goethals, On the nonbinary Johnson scheme
1985
Earlier work this paper cites.
W. Rudin, Real and Complex Analysis
1987
Earlier work this paper cites.
A.E. Brouwer, A.M. Cohen and A. Neumaier, Distance-regular graphs , Springer-Verlag, Berlin, 1989
1989
Earlier work this paper cites.
R. A. Horn, C. R. Johnson, Matrix analysis
1990
Earlier work this paper cites.
T.Y. Lam, A first course in noncommutative rings
1991
Earlier work this paper cites.
B. Sturmfels, Algorithms in Invariant Theory
1993
Earlier work this paper cites.
N.Ja. Vilenkin, A.U. Klimyk, Representation of Lie Groups and Special Functions, Volume 2
1993
Cited alongside, same era.
D.R. Woodall, Cyclic-order graphs and Zarankiewicz’s crossing-number conjecture
1993
Cited alongside, same era.
D.E. Knuth, The sandwich theorem
1994
Cited alongside, same era.
V.I. Levenshtein, Universal bounds for codes and designs
1998
Cited alongside, same era.
G.E. Andrews, R. Askey, R. Roy, Special functions
1999
Cited alongside, same era.
J.H. Conway, N.J.A. Sloane, Sphere Packings, Lattices and Groups
1999
Cited alongside, same era.
E. de Klerk, D.V. Pasechnik, A. Schrijver, Reduction of symmetric semidefinite programs using the regular ∗ * -representation
2007
Later among the works it cites.
E. de Klerk, D.V. Pasechnik, R. Sotirov, On Semidefinite Programming Relaxations of the Travelling Salesman Problem
2007
Later among the works it cites.
M. Laurent, Strengthened semidefinite programming bounds for codes
2007
Later among the works it cites.
A. Nemirovski, Advances in convex optimization: Conic programming
2007
Later among the works it cites.
C. Bachoc, F. Vallentin, New upper bounds for kissing numbers from semidefinite programming
2008
Later among the works it cites.
N. Gvozdenović, Approximating the stability number and the chromatic number of a graph via semidefinite programming
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1999
Cited alongside, same era.
J.F. Sturm, Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
1999
Cited alongside, same era.
H. Tarnanen, Upper bounds on permutation codes via linear programming
1999
Cited alongside, same era.
T. Ericson, V. Zinoviev, Codes on Euclidean spheres
2001
Cited alongside, same era.
Y. Kanno, M. Ohsaki, K. Murota, N. Katoh, Group symmetry in interior-point methods for semidefinite program
2001
Cited alongside, same era.
J.B Lasserre, An explicit exact SDP relaxation for nonlinear 0/1 programs
2001
Cited alongside, same era.
2008
Later among the works it cites.
N. Gvozdenović, M. Laurent, The operator Ψ \Psi for the chromatic number of a graph
2008
Later among the works it cites.
N. Gvozdenović, M. Laurent, Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization
2008
Later among the works it cites.
A. Soifer, The mathematical coloring book
2008
Later among the works it cites.
F. Vallentin, Optimal embeddings of distance transitive graphs into Euclidean spaces
2008
Later among the works it cites.
C. Bachoc, F. Vallentin, Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
2009
Later among the works it cites.
C. Bachoc, F. Vallentin, Optimality and uniqueness of the (4,10,1/6) spherical code
2009
Later among the works it cites.
C. Bachoc, G. Nebe, F.M. de Oliveira Filho, F. Vallentin, Lower bounds for measurable chromatic numbers
2009
Later among the works it cites.
Y. Bai, E. de Klerk, D.V. Pasechnik, R. Sotirov, Exploiting group symmetry in truss topology optimization
2009
Later among the works it cites.
A. Barg, P. Purkayastha, Bounds on ordered codes and orthogonal arrays
2009
Later among the works it cites.
J. Cimpric̆, S. Kuhlmann, C. Scheiderer, Sums of squares and moment problems in equivariant situations
2009
Later among the works it cites.
E. de Klerk, C. Dobre, D.V. Pasechnik, Numerical block diagonalization of matrix *-algebras with application to semidefinite programming
2009
Later among the works it cites.
N. Gvozdenović, M. Laurent, F. Vallentin, Block-diagonal semidefinite programming hierarchies for 0/1 programming
2009
Later among the works it cites.
E. de Klerk, M.W. Newman, D.V. Pasechnik, R. Sotirov, On the Lovasz θ \theta -number of almost regular graphs with application to Erdős-Rényi graphs
2009
Later among the works it cites.
M. Laurent, Sums of squares, moment matrices and optimization over polynomials
2009
Later among the works it cites.
F.M. de Oliveira Filho, New Bounds for Geometric Packing and Coloring via Harmonic Analysis and Optimization
2009
Later among the works it cites.
A. Roy, A. J. Scott, Unitary designs and codes
2009
Later among the works it cites.
F. Vallentin, Symmetry in semidefinite programs
2009
Later among the works it cites.
C. Bachoc, G. Zémor, Bounds for binary codes relative to pseudo-distances of k k points
2010
Closest in time.
J. Creignou, H. Diet, Linear programming bounds for unitary codes
2010
Closest in time.
E. de Klerk, Exploiting special structure in semidefinite programming: A survey of theory and applications
2010
Closest in time.
E. de Klerk, R. Sotirov, Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
2010
Closest in time.
H.D. Mittelmann, F. Vallentin, High accuracy semidefinite programming bounds for kissing numbers
2010
Closest in time.
F.M. de Oliveira Filho, F. Vallentin, Fourier analysis, linear programming, and densities of distance avoiding sets in ℝ n {\mathbb{R}}^{n}
2010
Closest in time.
D.V. Pasechnik, K. Kini, A GAP package for computation with coherent configurations
2010
Closest in time.
F. Vallentin, Lecture notes: Semidefinite programs and harmonic analysis
2017
Closest in time.