A COUNTEREXAMPLE TO A CONJECTURE OF LARMAN AND ROGERS ON SETS AVOIDING DISTANCE 1.
- Published in:
- Mathematika, 2019, v. 65, n. 3, p. 785, doi. 10.1112/S0025579319000160
- By:
- Publication type:
- Article
Works matching AU de Oliveira Filho, Fernando Mário
Results: 5
1
2
Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry.
- Published in:
- Experimental Mathematics, 2018, v. 27, n. 3, p. 362, doi. 10.1080/10586458.2017.1286273
- By:
- Publication type:
- Article
3
k-Point semidefinite programming bounds for equiangular lines.
- Published in:
- Mathematical Programming, 2022, v. 194, n. 1/2, p. 533, doi. 10.1007/s10107-021-01638-x
- By:
- Publication type:
- Article
4
Complete positivity and distance-avoiding sets.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 487, doi. 10.1007/s10107-020-01562-6
- By:
- Publication type:
- Article
5
Fourier analysis, linear programming, and densities of distance avoiding sets in R<sup>n</sup>.
- Published in:
- Journal of the European Mathematical Society (EMS Publishing), 2010, v. 12, n. 6, p. 1417, doi. 10.4171/JEMS/236
- By:
- Publication type:
- Article