Optimization hierarchies for distance-avoiding sets in compact spaces
From MaRDI portal
Cites work
- \(k\)-point semidefinite programming bounds for equiangular lines
- A copositive formulation for the stability number of infinite graphs
- A linear programming reformulation of the standard quadratic optimization problem
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
- A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces
- A semidefinite programming hierarchy for packing problems in discrete geometry
- Approximation of the stability number of a graph via copositive programming
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Complete positivity and distance-avoiding sets
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Convexity. An analytic viewpoint
- Fourier analysis, linear programming, and densities of distance avoiding sets in R^n
- Geometric algorithms and combinatorial optimization
- Global optimization with polynomials and the problem of moments
- Hilbert distances and positive definite functions
- scientific article; zbMATH DE number 3477793 (Why is no real title available?)
- scientific article; zbMATH DE number 1324223 (Why is no real title available?)
- scientific article; zbMATH DE number 918597 (Why is no real title available?)
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- Intersection theorems with geometric consequences
- Lower bounds for measurable chromatic numbers
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- New upper bounds for kissing numbers from semidefinite programming
- New upper bounds on sphere packings. I
- On the Shannon capacity of a graph
- Positive definite functions on spheres
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
- Solving clustered low-rank semidefinite programs arising from polynomial optimization
- Some homotopy properties of spaces of finite subsets of topological spaces
- Some old and new problems in combinatorial geometry. I: Around Borsuk's problem
- Spherical codes and designs
- Spherical Sets Without Orthogonal Point Pairs
- Symmetry groups, semidefinite programs, and sums of squares
- The sphere packing problem in dimension 8
- The sphere packing problem in dimension \(24\)
- Two-point homogeneous spaces
- Upper bounds for packings of spheres of several radii
This page was built for publication: Optimization hierarchies for distance-avoiding sets in compact spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884483)
