Symmetric sums of squares over \(k\)-subset hypercubes
From MaRDI portal
Publication:1702778
DOI10.1007/s10107-017-1127-6zbMath1383.05306arXiv1606.05639OpenAlexW2962948547MaRDI QIDQ1702778
James Saunderson, Rekha R. Thomas, Annie Raymond, Mohit Singh
Publication date: 28 February 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.05639
Semidefinite programming (90C22) Representations of finite symmetric groups (20C30) Combinatorial optimization (90C27) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Extremal combinatorics (05D99)
Related Items
Symmetry in Turán sums of squares polynomials from flag algebras, Symmetry Reduction in AM/GM-Based Optimization, Reflection groups and cones of sums of squares, Breaking symmetries to rescue sum of squares in the case of makespan scheduling, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Simple graph density inequalities with no sum of squares proofs, Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling, Unnamed Item, Sum of squares bounds for the ordering principle, Symmetry Adapted Gram Spectrahedra, High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts, Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory, Bounding Monochromatic Triangles Using Squares
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sums of squares on the hypercube
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Strengthened semidefinite programming bounds for codes
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Exploiting group symmetry in truss topology optimization
- Symmetry in Turán sums of squares polynomials from flag algebras
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- Sum-of-squares hierarchy lower bounds for symmetric formulations
- On Turán's \((3,4)\)-problem with forbidden subgraphs
- Semidefinite bounds for nonbinary codes based on quadruples
- Invariant Semidefinite Programs
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New upper bounds for kissing numbers from semidefinite programming
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- Semidefinite Optimization and Convex Algebraic Geometry
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- On the sum-of-squares degree of symmetric quadratic functions
- Undecidability of linear inequalities in graph homomorphism densities
- Flag algebras
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- On a problem of K. Zarankiewicz
- Complexity of Positivstellensatz proofs for the knapsack
