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

DOI10.1090/proc/15940zbMath1495.05199arXiv2106.09360OpenAlexW4287117199MaRDI QIDQ5097318

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

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

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

Cites Work

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

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