Pages that link to "Item:Q3547598"
From MaRDI portal
The following pages link to New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming (Q3547598):
Displayed 50 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- On optimal binary codes with unbalanced coordinates (Q371241) (← links)
- New inequalities for \(q\)-ary constant-weight codes (Q398941) (← links)
- The Goldman-Rota identity and the Grassmann scheme (Q405125) (← links)
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- Wreath product action on generalized Boolean algebras (Q491535) (← links)
- On Lee association schemes over \(\mathbb{Z}_4\) and their Terwilliger algebra (Q501247) (← links)
- Nonsymmetric Askey-Wilson polynomials and \(Q\)-polynomial distance-regular graphs (Q501689) (← links)
- Combinatorial extensions of Terwilliger algebras and wreath products of association schemes (Q512559) (← links)
- The triple distribution of codes and ordered codes (Q641207) (← links)
- Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme (Q644673) (← links)
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
- Towards a proof of the 24-cell conjecture (Q722369) (← links)
- Bounds for codes by semidefinite programming (Q735630) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming (Q855871) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Strengthened semidefinite programming bounds for codes (Q868466) (← links)
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation (Q868475) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4 (Q901158) (← links)
- Symmetry in semidefinite programs (Q958029) (← links)
- Problems from CGCS Luminy, May 2007 (Q966173) (← links)
- New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra (Q1011516) (← links)
- Leonard triples and hypercubes (Q1016021) (← links)
- Bounds on subsets of coherent configurations (Q1024878) (← links)
- A survey on spherical designs and algebraic combinatorics on spheres (Q1039420) (← links)
- Commutative association schemes (Q1039424) (← links)
- Exploiting group symmetry in truss topology optimization (Q1041375) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
- The sextuply shortened binary Golay code is optimal (Q1727350) (← links)
- The joint weight enumerator of an LCD code and its dual (Q1730215) (← links)
- An Assmus-Mattson theorem for codes over commutative association schemes (Q1744016) (← links)
- Semidefinite bounds for mixed binary/ternary codes (Q1744761) (← links)
- Varietal Terwilliger algebras arising from wreath products of rank two association schemes (Q1755573) (← links)
- Improved linear programming bound on sizes of doubly constant-weight codes (Q1800703) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- Group symmetry and covariance regularization (Q1950873) (← links)
- Optimal binary constant weight codes and affine linear groups over finite fields (Q1999901) (← links)
- Uniqueness of codes using semidefinite programming (Q1999906) (← links)
- The quantum adjacency algebra and subconstituent algebra of a graph (Q2000651) (← links)
- Pseudo-direct sums and wreath products of loose-coherent algebras with applications to coherent configurations (Q2013186) (← links)
- The Terwilliger algebra of the halved \(n\)-cube from the viewpoint of its automorphism group action (Q2066017) (← links)
- \(Q\)-polynomial coherent configurations (Q2120925) (← links)
- Algebras, graphs and thetas (Q2132354) (← links)
- \(k\)-point semidefinite programming bounds for equiangular lines (Q2149560) (← links)
- The Terwilliger algebra of the halved folded \(2n\)-cube from the viewpoint of its automorphism group action (Q2159397) (← links)