A recursive Lovász theta number for simplex-avoiding sets

DOI10.1090/PROC/15940MaRDI QIDQ5097318zbMATH OpenOpenAlexFDO

Authors D. Castro-Silva, Fernando Mário de Oliveira Filho, Lucas Slot, Frank Vallentin

Publication date 23 August 2022

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2106.09360

Mathematics Subject Classification ID

Hypergraphs (05C65) Ramsey theory (05D10) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Erd?s problems and related topics of discrete geometry (52C10) Semidefinite programming (90C22)

Abstract: We recursively extend the Lov'asz theta number to geometric hypergraphs on the unit sphere and on Euclidean space, obtaining an upper bound for the independence ratio of these hypergraphs. As an application we reprove a result in Euclidean Ramsey theory in the measurable setting, namely that every $k$-simplex is exponentially Ramsey, and we improve existing bounds for the base of the exponential.

Recommendations

• The theta number of simplicial complexes
• Strong Ramsey properties of simplices
• The density of sets avoiding distance 1 in Euclidean space
• Lower bounds for measurable chromatic numbers
• On Ramsey sets in spheres

Cites work

• A comparison of the Delsarte and Lovász bounds
• Complete positivity and distance-avoiding sets
• Computing upper bounds for the packing density of congruent copies of a convex body
• Forbidden Intersections
• Fourier analysis, linear programming, and densities of distance avoiding sets in R^n
• 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 1231230 (Why is no real title available?)
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• Improved Frankl-Rödl theorem and some of its geometric consequences
• Intersection theorems with geometric consequences
• Lower bounds for measurable chromatic numbers
• Metric spaces and completely monontone functions
• New upper bounds on sphere packings. I
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• On the Frankl-Rödl theorem
• On the Shannon capacity of a graph
• Positive definite functions on spheres
• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• Semidefinite programming in combinatorial optimization
• Spectral bounds for the independence ratio and the chromatic number of an operator
• Spherical codes and designs
• The chromatic number of the plane is at least 5
• The density of sets avoiding distance 1 in Euclidean space
• The Mathematical Coloring Book
• The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\)
• The realization of distances in measurable subsets covering R^ n.
• Upper bounds for packings of spheres of several radii
• Upper bounds for the zeros of ultraspherical polynomials

Cited in

(5)

• The theta number of simplicial complexes
• A recursive theta body for hypergraphs
• Cutting corners
• Spherical sets avoiding orthonormal bases
• Density Frankl-Rödl on the sphere

This page was built for publication: A recursive Lovász theta number for simplex-avoiding sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097318)