Symmetry in Turán sums of squares polynomials from flag algebras
From MaRDI portal
Publication:1637376
DOI10.5802/alco.5zbMath1388.05186arXiv1507.03059OpenAlexW2963105968MaRDI QIDQ1637376
Rekha R. Thomas, Mohit Singh, Annie Raymond
Publication date: 8 June 2018
Published in: Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.03059
Semidefinite programming (90C22) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Extremal combinatorics (05D99)
Related Items
Tropicalization of graph profiles, Symmetric sums of squares over \(k\)-subset hypercubes, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, Simple graph density inequalities with no sum of squares proofs, Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling, Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations, Symmetry Adapted Gram Spectrahedra, Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact result for 3-graphs
- Asymptotic solution for a new class of forbidden r-graphs
- An exact Turán result for the generalized triangle
- An upper bound for the Turán number \(t_3(n,4)\)
- Semidefinite programming relaxations for semialgebraic problems
- Symmetric sums of squares over \(k\)-subset hypercubes
- Symmetry groups, semidefinite programs, and sums of squares
- On Turán's \((3,4)\)-problem with forbidden subgraphs
- Relaxations of Combinatorial Problems Via Association Schemes
- Invariant Semidefinite Programs
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- An Exact Result for Hypergraphs and Upper Bounds for the Turán Density of $K^r_{r+1}$
- A comparison of the Delsarte and Lovász bounds
- Semidefinite Optimization and Convex Algebraic Geometry
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- The Mathematics of Paul Erdős II
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Flag algebras
- On the structure of linear graphs