Fernando Mário de Oliveira Filho
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Fernando Mário de Oliveira Filho has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Frank Vallentin
Universität zu Köln, Germany
10 shared publications - Alexander Kolpakov
University of Austin, Austin TX, USA
2 shared publications - Evan DeCorte
Mathematics and Statistics, McGill University, Montreal, Canada
2 shared publications - Fabrício Caluza Machado
Instituto de Matemática e Estatística, Universidade de São Paulo, São Paulo, Brazil
2 shared publications - Imre Z. Ruzsa
Alfréd Rényi Institute of Mathematics
2 shared publications - Tamás Keleti
Institute of Mathematics, Eotvos Lorand University, Budapest, Hungary
2 shared publications
Latest Publications
- Open Access
Complete positivity and distance-avoiding sets
We introduce the cone of completely-positive functions, a subset of the cone of positive-type functions, and use it to fully characterize maximum-density distance-avoiding sets as the optimal solutions of a convex optimization problem. As a consequence of this characterization, it is possible to reprove and improve many results concerning distance-avoiding sets on the sphere and in Euclidean space.
Open AccessComplete positivity and distance-avoiding sets
We introduce the cone of completely-positive functions, a subset of the cone of positive-type functions, and use it to fully characterize maximum-density distance-avoiding sets as the optimal solutions of a convex optimization problem. As a consequence of this characterization, it is possible to reprove and improve many results concerning distance-avoiding sets on the sphere and in Euclidean space.
- 6 March 2022
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 247 (2) , 635-659
Semidefinite programming bounds for the average kissing number
- 6 March 2022
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 247 (2) , 635-659
Semidefinite programming bounds for the average kissing number
- Open Access
- 21 April 2021
- Published by Springer Nature in Mathematical Programming
- Vol. 194 (1-2) , 533-567
k-Point semidefinite programming bounds for equiangular lines
We propose a hierarchy of k-point bounds extending the Delsarte–Goethals–Seidel linear programming 2-point bound and the Bachoc–Vallentin semidefinite programming 3-point bound for spherical codes. An optimized implementation of this hierarchy allows us to compute 4, 5, and 6-point bounds for the maximum number of equiangular lines in Euclidean space with a fixed common angle.
- 21 April 2021
- Published by Springer Nature in Mathematical Programming
- Vol. 194 (1-2) , 533-567
Open Accessk-Point semidefinite programming bounds for equiangular lines
We propose a hierarchy of k-point bounds extending the Delsarte–Goethals–Seidel linear programming 2-point bound and the Bachoc–Vallentin semidefinite programming 3-point bound for spherical codes. An optimized implementation of this hierarchy allows us to compute 4, 5, and 6-point bounds for the maximum number of equiangular lines in Euclidean space with a fixed common angle.
- Open Access
- 16 September 2020
- Published by Springer Nature in Mathematical Programming
- Vol. 191 (2) , 487-558
Complete positivity and distance-avoiding sets
We introduce the cone of completely positive functions, a subset of the cone of positive-type functions, and use it to fully characterize maximum-density distance-avoiding sets as the optimal solutions of a convex optimization problem. As a consequence of this characterization, it is possible to reprove and improve many results concerning distance-avoiding sets on the sphere and in Euclidean space.
- 16 September 2020
- Published by Springer Nature in Mathematical Programming
- Vol. 191 (2) , 487-558
Open AccessComplete positivity and distance-avoiding sets
We introduce the cone of completely positive functions, a subset of the cone of positive-type functions, and use it to fully characterize maximum-density distance-avoiding sets as the optimal solutions of a convex optimization problem. As a consequence of this characterization, it is possible to reprove and improve many results concerning distance-avoiding sets on the sphere and in Euclidean space.
- Open Access
Semidefinite programming bounds for the average kissing number
The average kissing number of $\mathbb{R}^n$ is the supremum of the average degrees of contact graphs of packings of finitely many balls (of any radii) in $\mathbb{R}^n$. We provide an upper bound for the average kissing number based on semidefinite programming that improves previous bounds in dimensions $3, \ldots, 9$. A very simple upper bound for the average kissing number is twice the kissing number; in dimensions $6, \ldots, 9$ our new bound is the first to improve on this simple upper bound.Open AccessSemidefinite programming bounds for the average kissing number
The average kissing number of $\mathbb{R}^n$ is the supremum of the average degrees of contact graphs of packings of finitely many balls (of any radii) in $\mathbb{R}^n$. We provide an upper bound for the average kissing number based on semidefinite programming that improves previous bounds in dimensions $3, \ldots, 9$. A very simple upper bound for the average kissing number is twice the kissing number; in dimensions $6, \ldots, 9$ our new bound is the first to improve on this simple upper bound. - Open Access
$k$-point semidefinite programming bounds for equiangular lines
We give a hierarchy of $k$-point bounds extending the Delsarte-Goethals-Seidel linear programming $2$-point bound and the Bachoc-Vallentin semidefinite programming $3$-point bound for spherical codes. An optimized implementation of this hierarchy allows us to compute~$4$, $5$, and $6$-point bounds for the maximum number of equiangular lines in Euclidean space with a fixed common angle.Open Access$k$-point semidefinite programming bounds for equiangular lines
We give a hierarchy of $k$-point bounds extending the Delsarte-Goethals-Seidel linear programming $2$-point bound and the Bachoc-Vallentin semidefinite programming $3$-point bound for spherical codes. An optimized implementation of this hierarchy allows us to compute~$4$, $5$, and $6$-point bounds for the maximum number of equiangular lines in Euclidean space with a fixed common angle. - Open Access
A counterexample to a conjecture of Larman and Rogers on sets avoiding distance 1
For $n \geq 2$ we construct a measurable subset of the unit ball in $\mathbb{R}^n$ that does not contain pairs of points at distance 1 and whose volume is greater than $(1/2)^n$ times the volume of the ball. This disproves a conjecture of Larman and Rogers from 1972.Open AccessA counterexample to a conjecture of Larman and Rogers on sets avoiding distance 1
For $n \geq 2$ we construct a measurable subset of the unit ball in $\mathbb{R}^n$ that does not contain pairs of points at distance 1 and whose volume is greater than $(1/2)^n$ times the volume of the ball. This disproves a conjecture of Larman and Rogers from 1972. - 1 January 2019
- Published by Wiley in Mathematika
- Vol. 65 (3) , 785-787
A COUNTEREXAMPLE TO A CONJECTURE OF LARMAN AND ROGERS ON SETS AVOIDING DISTANCE 1
- 1 January 2019
- Published by Wiley in Mathematika
- Vol. 65 (3) , 785-787
A COUNTEREXAMPLE TO A CONJECTURE OF LARMAN AND ROGERS ON SETS AVOIDING DISTANCE 1
- 3 November 2018
- Published by Springer Nature
- p. 155-188
Computing Upper Bounds for the Packing Density of Congruent Copies of a Convex Body
- 3 November 2018
- Published by Springer Nature
- p. 155-188
Computing Upper Bounds for the Packing Density of Congruent Copies of a Convex Body
- Open Access
Computing upper bounds for the packing density of congruent copies of a convex body
In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We illustrate its use by computing an upper bound for the maximum density of packings of regular pentagons in the plane. Our computational approach is numerical and uses a combination of semidefinite programming, sums of squares, and the harmonic analysis of the Euclidean motion group. We show how, with some extra work, the bounds so obtained can be made rigorous.
Open AccessComputing upper bounds for the packing density of congruent copies of a convex body
In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We illustrate its use by computing an upper bound for the maximum density of packings of regular pentagons in the plane. Our computational approach is numerical and uses a combination of semidefinite programming, sums of squares, and the harmonic analysis of the Euclidean motion group. We show how, with some extra work, the bounds so obtained can be made rigorous.