On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs [PDF]
AMS classifications: 05C69; 90C35; 90C22;Erdos-Renyi graph;stability number;Lovasz O-number;Schrijver O-number;C*-algebra;semidefinite ...
Klerk, E. de +3 more
core +1 more source
Positivity of continuous piecewise polynomials
, 2011 Real algebraic geometry provides certificates for the positivity of polynomials on semi-algebraic sets by expressing them as a suitable combination of sums of squares and the defining inequalitites.
Plaumann, Daniel
core +1 more source
Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem [PDF]
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment ...
Klerk, E. de, Sotirov, R.
core +1 more source
Fourier analysis on finite groups and the Lov\'asz theta-number of Cayley graphs
, 2013 We apply Fourier analysis on finite groups to obtain simplified formulations for the Lov\'asz theta-number of a Cayley graph. We put these formulations to use by checking a few cases of a conjecture of Ellis, Friedgut, and Pilpel made in a recent article
de Laat, David +2 more
core +1 more source
Noisy tensor completion via the sum-of-squares hierarchy. [PDF]
Math Program, 2022 Barak B, Moitra A.
europepmc +1 more source
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs. [PDF]
Math Program, 2023 Hu H, Sotirov R, Wolkowicz H.
europepmc +1 more source
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion. [PDF]
J Sci Comput, 2021 Bellavia S, Gondzio J, Porcelli M.
europepmc +1 more source
Complete positivity and distance-avoiding sets. [PDF]
Math Program, 2022 DeCorte E, Filho FMO, Vallentin F.
europepmc +1 more source
A Note on the Stability Number of an Orthogonality Graph [PDF]
We consider the orthogonality graph (n) with 2n vertices corresponding to the vectors {0, 1}n, two vertices adjacent if and only if the Hamming distance between them is n/2.We show that, for n = 16, the stability number of (n) is ( (16)) = 2304, thus ...
Klerk, E. de, Pasechnik, D.V.
core +1 more source
Disentangling orthogonal matrices. [PDF]
Linear Algebra Appl, 2017 Zhang T, Singer A.
europepmc +1 more source