Pages that link to "Item:Q1047119"

The following pages link to Lower bounds for measurable chromatic numbers (Q1047119):

Displaying 18 items.

• A copositive formulation for the stability number of infinite graphs (Q344928) (← links)
• A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces (Q387573) (← links)
• Spectral bounds for the independence ratio and the chromatic number of an operator (Q466129) (← links)
• An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
• On a generalization of the Hadwiger-Nelson problem (Q522309) (← links)
• Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\) (Q604438) (← links)
• Complete positivity and distance-avoiding sets (Q2118086) (← links)
• \(k\)-point semidefinite programming bounds for equiangular lines (Q2149560) (← links)
• Polynomial configurations in sets of positive upper density over local fields (Q2227134) (← links)
• Lower bounds for the measurable chromatic number of the hyperbolic plane (Q2316800) (← links)
• The density of sets avoiding distance 1 in Euclidean space (Q2351016) (← links)
• Open sets avoiding integral distances (Q2391837) (← links)
• Invariant Semidefinite Programs (Q2802527) (← links)
• Coloring the Voronoi tessellation of lattices (Q3384034) (← links)
• Exact Semidefinite Programming Bounds for Packing Problems (Q4989941) (← links)
• A recursive Lovász theta number for simplex-avoiding sets (Q5097318) (← links)
• Upper bounds for packings of spheres of several radii (Q5496785) (← links)
• Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)