Complete positivity and distance-avoiding sets
From MaRDI portal
(Redirected from Publication:2118086)
Abstract: We introduce the cone of completely-positive functions, a subset of the cone of positive-type functions, and use it to fully characterize maximum-density distance-avoiding sets as the optimal solutions of a convex optimization problem. As a consequence of this characterization, it is possible to reprove and improve many results concerning distance-avoiding sets on the sphere and in Euclidean space.
Recommendations
- Measurable sets with excluded distances
- On the density of sets avoiding parallelohedron distance 1
- The density of sets avoiding distance 1 in Euclidean space
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- Spherical sets avoiding a prescribed set of angles
Cites work
- scientific article; zbMATH DE number 16111 (Why is no real title available?)
- scientific article; zbMATH DE number 3477793 (Why is no real title available?)
- scientific article; zbMATH DE number 3483022 (Why is no real title available?)
- scientific article; zbMATH DE number 3634289 (Why is no real title available?)
- scientific article; zbMATH DE number 1324223 (Why is no real title available?)
- scientific article; zbMATH DE number 739280 (Why is no real title available?)
- scientific article; zbMATH DE number 1943977 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 3280855 (Why is no real title available?)
- A Szemerédi type theorem for sets of positive density in \(\mathbb R^k\)
- A comparison of the Delsarte and Lovász bounds
- A copositive formulation for the stability number of infinite graphs
- A counterexample to a conjecture of Larman and Rogers on sets avoiding distance 1
- A linear programming reformulation of the standard quadratic optimization problem
- A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces
- A semidefinite programming hierarchy for packing problems in discrete geometry
- Better bounds for planar sets avoiding unit distances
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Convexity. An analytic viewpoint
- Curvatures of left invariant metrics on Lie groups
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- Geometric algorithms and combinatorial optimization
- Geometry of cuts and metrics
- Limits of dense graph sequences
- Linear inequalities and quadratic forms
- Lower bounds for measurable chromatic numbers
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Measurable sets with excluded distances
- New upper bounds on sphere packings. I
- On the Shannon capacity of a graph
- On the Turing model complexity of interior point methods for semidefinite programming
- Plane Sets with Positive Density at Infinity Contain all Large Distances
- Positive definite functions on spheres
- Problems, problems, problems
- Reducibility among combinatorial problems
- Some old and new problems in combinatorial geometry. I: Around Borsuk's problem
- Spherical Sets Without Orthogonal Point Pairs
- Spherical codes and designs
- Spherical sets avoiding a prescribed set of angles
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The density of sets avoiding distance 1 in Euclidean space
- The realization of distances in measurable subsets covering R^ n.
- The realization of distances within sets in Euclidean space
- The sphere packing problem in dimension 8
- The sphere packing problem in dimension \(24\)
Cited in
(6)- A recursive Lovász theta number for simplex-avoiding sets
- On the structure of sets with positive reach
- Density estimates of 1-avoiding sets via higher order correlations
- The density of planar sets avoiding unit distances
- A counterexample to a conjecture of Larman and Rogers on sets avoiding distance 1
- A positive fraction mutually avoiding sets theorem
This page was built for publication: Complete positivity and distance-avoiding sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118086)
