arXiv subjects

Fabrício Caluza Machado

Publications and source records attributed to Fabrício Caluza Machado.

5 recordsLinked to original sources

arXiv2023

The Lasserre hierarchy for equiangular lines with a fixed angle

We compute the second and third levels of the Lasserre hierarchy for the spherical finite distance problem. A connection is used between invariants in representations of the orthogonal group and representations of the general linear group, which allows computations in high dimensions. We give new linear bounds on the maximum number of equiangular lines in dimension $n$ with common angle $\arccos α$. These are obtained through asymptotic analysis in $n$ of the semidefinite programming bound given by the second level.

math.MG↗

arXiv2022

Coefficients of the solid angle and Ehrhart quasi-polynomials

Macdonald studied a discrete volume measure for a rational polytope $P$, called solid angle sum, that gives a natural discrete volume for $P$. We give a local formula for the codimension two quasi-coefficient of the solid angle sum of $P$. We also show how to recover the classical Ehrhart quasi-polynomial from the solid angle sum and in particular we find a similar local formula for the codimension one and codimension two quasi-coefficients. These local formulas are naturally valid for all positive real dilates of $P$. An interesting open question is to determine necessary and sufficient conditions on a polytope $P$ for which the discrete volume of $P$ given by the solid angle sum equals its continuous volume: $A_P(t) = \mathrm{vol}(P) t^d$. We prove that a sufficient condition is that $P$ tiles $\mathbb R^d$ by translations, together with the Hyperoctahedral group.

math.CO↗

arXiv2021

The null set of a polytope, and the Pompeiu property for polytopes

We study the null set $N(\mathcal{P})$ of the Fourier-Laplace transform of a polytope $\mathcal{P} \subset \mathbb{R}^d$, and we find that $N(\mathcal{P})$ does not contain (almost all) circles in $\mathbb{R}^d$. As a consequence, the null set does not contain the algebraic varieties $\{z \in \mathbb{C}^d \mid z_1^2 + \dots + z_d^2 = α^2\}$ for each fixed $α\in \mathbb{C}$, and hence we get an explicit proof that the Pompeiu property is true for all polytopes. Our proof uses the Brion-Barvinok theorem, which gives a concrete formulation for the Fourier-Laplace transform of a polytope, and it also uses properties of Bessel functions. The original proof that polytopes (as well as other bodies) possess the Pompeiu property was given by Brown, Schreiber, and Taylor (1973) for dimension 2. Williams (1976) later observed that the same proof also works for $d>2$ and, using eigenvalues of the Laplacian, gave another proof valid for $d \geq 2$ that polytopes have the Pompeiu property.

math.MG↗

arXiv2019

$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.

math.OC↗

arXiv2016

Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry

The kissing number of $\mathbb{R}^n$ is the maximum number of pairwise-nonoverlapping unit spheres that can simultaneously touch a central unit sphere. Mittelmann and Vallentin (2010), based on the semidefinite programming bound of Bachoc and Vallentin (2008), computed the best known upper bounds for the kissing number for several values of $n \leq 23$. In this paper, we exploit the symmetry present in the semidefinite programming bound to provide improved upper bounds for $n = 9, \ldots, 23$.

math.OC↗