The following pages link to Fernando Mário de Oliveira Filho (Q282752):
Displaying 18 items.
- Better bounds for planar sets avoiding unit distances (Q282753) (← 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)
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\) (Q604438) (← links)
- Lower bounds for measurable chromatic numbers (Q1047119) (← links)
- Complete positivity and distance-avoiding sets (Q2118086) (← links)
- \(k\)-point semidefinite programming bounds for equiangular lines (Q2149560) (← links)
- New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry (Q2408217) (← links)
- Computing upper bounds for the packing density of congruent copies of a convex body (Q2417583) (← links)
- Flag Algebras: A First Glance (Q2988062) (← links)
- Grothendieck inequalities for semidefinite programs with rank constraint (Q3191609) (← links)
- The Positive Semidefinite Grothendieck Problem with Rank Constraint (Q3587367) (← links)
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry (Q4689862) (← links)
- A recursive Lovász theta number for simplex-avoiding sets (Q5097318) (← links)
- On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension (Q5126773) (← links)
- A COUNTEREXAMPLE TO A CONJECTURE OF LARMAN AND ROGERS ON SETS AVOIDING DISTANCE 1 (Q5377119) (← links)
- Upper bounds for packings of spheres of several radii (Q5496785) (← links)
- A recursive theta body for hypergraphs (Q6081405) (← links)
