ﻻ يوجد ملخص باللغة العربية
We provide new answers about the placement of mass on spheres so as to minimize energies of pairwise interactions. We find optimal measures for the $p$-frame energies, i.e. energies with the kernel given by the absolute value of the inner product raised to a positive power $p$. Application of linear programming methods in the setting of projective spaces allows for describing the minimizing measures in full in several cases: we show optimality of tight designs and of the $600$-cell for several ranges of $p$ in different dimensions. Our methods apply to a much broader class of potential functions, those which are absolutely monotonic up to a particular order as functions of the cosine of the geodesic distance. In addition, a preliminary numerical study is presented which suggests optimality of several other highly symmetric configurations and weighted designs in low dimensions. In one case we improve the best known lower bounds on a minimal sized weighted design in $mathbb{CP}^4$. All these results point to the discreteness of minimizing measures for the $p$-frame energy with $p$ not an even integer.
For a collection of $N$ unit vectors $mathbf{X}={x_i}_{i=1}^N$, define the $p$-frame energy of $mathbf{X}$ as the quantity $sum_{i eq j} |langle x_i,x_j rangle|^p$. In this paper, we connect the problem of minimizing this value to another optimizatio
A Borel probability measure $mu$ on a locally compact group is called a spectral measure if there exists a subset of continuous group characters which forms an orthogonal basis of the Hilbert space $L^2(mu)$. In this paper, we characterize all spectr
We continue to develop a program in geometric measure theory that seeks to identify how measures in a space interact with canonical families of sets in the space. In particular, extending a theorem of the first author and R. Schul in Euclidean space,
To every finite metric space $X$, including all connected unweighted graphs with the minimum edge-distance metric, we attach an invariant that we call its blowup-polynomial $p_X({ n_x : x in X })$. This is obtained from the blowup $X[{bf n}]$ - which
In this paper, we use the linear programming approach to find new upper bounds for the moments of isotropic measures. These bounds are then utilized for finding lower packing bounds and energy bounds for projective codes. We also show that the obtain