Search

We report on a search for CAZAC sequences by using nonlinear sum of squares optimization. Up to equivalence, we found all length 7 CAZAC sequences. We obtained evidence suggesting there are finitely many length 10 CAZAC sequences with a total of 3040 sequences. Last, we compute longer sequences and compare their aperiodic autocorrelation properties to known sequences. The code and results of this search are publicly available through GitHub., Comment: 6 pages, 4 figures, submitted to IEEE Radar Conference 2023

Two decades ago, Zauner conjectured that for every dimension $d$, there exists an equiangular tight frame consisting of $d^2$ vectors in $\mathbb{C}^d$. Most progress to date explicitly constructs the promised frame in various dimensions, and it now appears that a constructive proof of Zauner's conjecture may require progress on the Stark conjectures. In this paper, we propose an alternative approach involving biangular Gabor frames that may eventually lead to an unconditional non-constructive proof of Zauner's conjecture., Comment: 6 pages, submitted to SPIE 2019 conference

The Lov\'{a}sz theta number is a semidefinite programming bound on the clique number of (the complement of) a given graph. Given a vertex-transitive graph, every vertex belongs to a maximal clique, and so one can instead apply this semidefinite programming bound to the local graph. In the case of the Paley graph, the local graph is circulant, and so this bound reduces to a linear programming bound, allowing for fast computations. Impressively, the value of this program with Schrijver's nonnegativity constraint rivals the state-of-the-art closed-form bound recently proved by Hanson and Petridis. We conjecture that this linear programming bound improves on the Hanson-Petridis bound infinitely often, and we derive the dual program to facilitate proving this conjecture., Comment: Wavelets and Sparsity XVIII

We apply the method of moments to prove a recent conjecture of Haikin, Zamir and Gavish (2017) concerning the distribution of the singular values of random subensembles of Paley equiangular tight frames. Our analysis applies more generally to real equiangular tight frames of redundancy 2, and we suspect similar ideas will eventually produce more general results for arbitrary choices of redundancy.

The line packing problem is concerned with the optimal packing of points in real or complex projective space so that the minimum distance between points is maximized. Until recently, all bounds on optimal line packings were known to be derivable from Delsarte's linear program. Last year, Bukh and Cox introduced a new bound for the line packing problem using completely different techniques. In this paper, we use ideas from the Bukh--Cox proof to find a new proof of the Welch bound, and then we use ideas from Delsarte's linear program to find a new proof of the Bukh--Cox bound. Hopefully, these unifying principles will lead to further refinements., Comment: 4 pages, conference: SampTA 2019

The construction of finite tight Gabor frames plays an important role in many applications. These applications include significant ones in signal and image processing. We explore when constant amplitude zero autocorrelation (CAZAC) sequences can be used to generate tight Gabor frames. The main theorem uses Janssen's representation and the zeros of the discrete periodic ambiguity function to give necessary and sufficient conditions for determining whether any Gabor frame is tight. The relevance of the theorem depends significantly on the construction of examples. These examples are necessarily intricate, and to a large extent, depend on CAZAC sequences. Finally, we present an alternative method for determining whether a Gabor system yields a tight frame. This alternative method does not prove tightness using the main theorem, but instead uses the Gram matrix of the Gabor system., Comment: 26 pages