Coherence Optimization and Best Complex Antipodal Spherical Codes

Vector sets with optimal coherence according to the Welch bound cannot exist for all pairs of dimension and cardinality. If such an optimal vector set exists, it is an equiangular tight frame and represents the solution to a Grassmannian line packing problem. Best Complex Antipodal Spherical Codes (BCASCs) are the best vector sets with respect to the coherence. By extending methods used to find best spherical codes in the real-valued Euclidean space, the proposed approach aims to find BCASCs, and thereby, a complex-valued vector set with minimal coherence. There are many applications demanding vector sets with low coherence. Examples are not limited to several techniques in wireless communication or to the field of compressed sensing. Within this contribution, existing analytical and numerical approaches for coherence optimization of complex-valued vector spaces are summarized and compared to the proposed approach. The numerically obtained coherence values improve previously reported results. The drawback of increased computational effort is addressed and a faster approximation is proposed which may be an alternative for time critical cases

Grassmannian Frames with Applications to Coding and Communication

For a given class ${\cal F}$ of uniform frames of fixed redundancy we define a Grassmannian frame as one that minimizes the maximal correlation $|< f_k,f_l >|$ among all frames $\{f_k\}_{k \in {\cal I}} \in {\cal F}$. We first analyze finite-dimensional Grassmannian frames. Using links to packings in Grassmannian spaces and antipodal spherical codes we derive bounds on the minimal achievable correlation for Grassmannian frames. These bounds yield a simple condition under which Grassmannian frames coincide with uniform tight frames. We exploit connections to graph theory, equiangular line sets, and coding theory in order to derive explicit constructions of Grassmannian frames. Our findings extend recent results on uniform tight frames. We then introduce infinite-dimensional Grassmannian frames and analyze their connection to uniform tight frames for frames which are generated by group-like unitary systems. We derive an example of a Grassmannian Gabor frame by using connections to sphere packing theory. Finally we discuss the application of Grassmannian frames to wireless communication and to multiple description coding.Comment: Submitted in June 2002 to Appl. Comp. Harm. Ana

Experimental study of energy-minimizing point configurations on spheres

In this paper we report on massive computer experiments aimed at finding spherical point configurations that minimize potential energy. We present experimental evidence for two new universal optima (consisting of 40 points in 10 dimensions and 64 points in 14 dimensions), as well as evidence that there are no others with at most 64 points. We also describe several other new polytopes, and we present new geometrical descriptions of some of the known universal optima.Comment: 41 pages, 12 figures, to appear in Experimental Mathematic

Three-point bounds for energy minimization

Three-point semidefinite programming bounds are one of the most powerful known tools for bounding the size of spherical codes. In this paper, we use them to prove lower bounds for the potential energy of particles interacting via a pair potential function. We show that our bounds are sharp for seven points in RP^2. Specifically, we prove that the seven lines connecting opposite vertices of a cube and of its dual octahedron are universally optimal. (In other words, among all configurations of seven lines through the origin, this one minimizes energy for all potential functions that are completely monotonic functions of squared chordal distance.) This configuration is the only known universal optimum that is not distance regular, and the last remaining universal optimum in RP^2. We also give a new derivation of semidefinite programming bounds and present several surprising conjectures about them.Comment: 30 page

Optimality and uniqueness of the Leech lattice among lattices

We prove that the Leech lattice is the unique densest lattice in R^24. The proof combines human reasoning with computer verification of the properties of certain explicit polynomials. We furthermore prove that no sphere packing in R^24 can exceed the Leech lattice's density by a factor of more than 1+1.65*10^(-30), and we give a new proof that E_8 is the unique densest lattice in R^8.Comment: 39 page

On the upper bound of the maximal absolute projection constant providing the simple proof of Grunbaum conjecture

Let $\lambda_\mathbb{K}(m)$ denote the maximal absolute projection constant over the subspaces of dimension $m$. Apart from the trivial case for $m=1$, the only known value of $\lambda_\mathbb{K}(m)$ is for $m=2$ and $\mathbb{K}=\mathbb{R}.$ In 1960, B.Grunbaum conjectured that $\lambda_\mathbb{R}(2)=\frac{4}{3}$ and in 2010, B. Chalmers and G. Lewicki proved it. In 2019, G. Basso delivered the alternative proof of this conjecture. Both proofs are quite complicated, and there was a strong belief that providing an exact value for $\lambda_\mathbb{K}(m)$ in other cases will be a tough task. In our paper, we present an upper bound of the value $\lambda_\mathbb{K}(m)$, which becomes an exact value for the numerous cases. The crucial will be combining some results from the articles [B. Bukh, C. Cox, Nearly orthogonal vectors and small antipodal spherical codes, Isr. J. Math. 238, 359-388 (2020)] and [G. Basso, Computation of maximal projection constants, J. Funct. Anal. 277/10 (2019), 3560-3585.], for which simplified proofs will be given

Distance-regular graphs

This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page

Is J enough? Comparison of gravitational waves emitted along the total angular momentum direction with other preferred orientations

The gravitational wave signature emitted from a merging binary depends on the orientation of an observer relative to the binary. Previous studies suggest that emission along the total initial or total final angular momenta leads to both the strongest and simplest signal from a precessing compact binary. In this paper we describe a concrete counterexample: a binary with $m_1/m_2=4$, $a_1=0.6 \hat{x} = -a_2$, placed in orbit in the x,y plane. We extract the gravitational wave emission along several proposed emission directions, including the initial (Newtonian) orbital angular momentum; the final (~ initial) total angular momentum; and the dominant principal axis of $<L_a L_b>_M$. Using several diagnostics, we show that the suggested preferred directions are not representative. For example, only for a handful of other directions (< 15%) will the gravitational wave signal have comparable shape to the one extracted along each of these fiducial directions, as measured by a generalized overlap (>0.95). We conclude that the information available in just one direction (or mode) does not adequately encode the complexity of orientation-dependent emission for even short signals from merging black hole binaries. Future investigations of precessing, unequal-mass binaries should carefully explore and model their orientation-dependent emission.Comment: v2 errat