Complex equiangular tight frames and erasures

In this paper we demonstrate that there are distinct differences between real and complex equiangular tight frames (ETFs) with regards to erasures. For example, we prove that there exist arbitrarily large non-trivial complex equiangular tight frames which are optimal against three erasures, and that such frames come from a unique class of complex ETFs. In addition, we extend certain results in Bodmann and Paulsen (2005) [2] to complex vector spaces as well as show that other results regarding real ETFs are not valid for complex ETFs.     

Steiner equiangular tight frames

We provide a new method for constructing equiangular tight frames (ETFs). The construction is valid in both the real and complex settings, and shows that many of the few previously-known examples of ETFs are but the first representatives of infinite families of such frames. It provides great freedom in terms of the frame’s size and redundancy. This method also explicitly constructs the frame vectors in their native domain, as opposed to implicitly defining them via their Gram matrix. Moreover, in this domain, the frame vectors are very sparse. The construction is extremely simple: a tensor-like combination of a Steiner system and a regular simplex. This simplicity permits us to resolve an open question regarding ETFs and the restricted isometry property (RIP): we show that the RIP behavior of some ETFs is unfortunately no better than their coherence indicates.     

A note on equiangular tight frames

We settle a conjecture of Joseph Renes about the existence and construction of certain equiangular tight frames.     

Complex Hadamard matrices

R. J. Turyn introduced complex Hadamard matrices and showed that if there is a complex Hadamard matrix of order c and a real Hadamard matrix of order h> > 1, then there is a real Hadamard matrix of order he. Previously, complex Hadamard matrices were only known for a few small orders and the orders for which symmetric conference matrices were known. These latter are known only to exist for orders which can be written as 1+a² +b² where a, b are integers. We give many constructions for new infinite classes of complex Hadamard matrices and show that they exist for orders 306,650, 870,1406,2450 and 3782: for the orders 650, 870, 2450 and 3782, a symmetric conference matrix cannot exist.     

Equiangular tight frames and fourth root seidel matrices

In this paper we construct complex equiangular tight frames (ETFs). In particular, we study the grammian associated with an ETF whose off-diagonal entries consist entirely of fourth roots of unity. These ETFs are classified, and we also provide some computational techniques which give rise to previously undiscovered ETFs.     

Deciding Hadamard equivalence of Hadamard matrices

Equivalence of Hadamard matrices can be decided inO(log² n) space, and hence in subexponential time. These resource bounds follow from the existence of small distinguishing sets.     

Embedding matrices in Hadamard matrices

It is shown that if A is any n×n matrix of zeros and ones, and if k is the smallest number not less than n which is the order of an Hadamard matrix, then A is a submatrix of an Hadamard matrix of order k².     

On the construction of equiangular frames from graphs

We give details of the 1-1 correspondence between equiangular frames of n vectors for and graphs with n vertices. This has been studied recently for tight equiangular frames because of applications to signal processing and quantum information theory. The nontight examples given here (which correspond to graphs with more than 2 eigenvalues) have the potential for similar applications, e.g., the frame corresponding to the 5-cycle graph is the unique Grassmannian frame of 5 vectors in openR³. Further, the associated canonical tight frames have a small number of angles in many cases.     

Power Hadamard matrices

We introduce power Hadamard matrices, in order to study the structure of (group) generalized Hadamard matrices, Butson (generalized) Hadamard matrices and other related orthogonal matrices, with which they share certain common characteristics. The new objects turn out to be as interesting, and perhaps as useful, as the objects that motivated them.We develop a basic theory of power Hadamard matrices, explore these relationships, and offer some new insights into old results. For example, we show that all 4×4 Butson Hadamard matrices are equivalent to circulant ones, and how to move between equivalence classes.We provide, among other new things, an infinite family of circulant Butson Hadamard matrices that extends a known class to include one of each positive integer order.Dedication: In 1974 Jennifer Seberry (Wallis) introduced what was then a totally new structure, orthogonal designs, in order to study the existence and construction of Hadamard matrices. They have proved their worth for this purpose, and have also become an object of interest for their own sake and in applications (e.g., [H.J.V. Tarok, A.R. Calderbank, Space-time block codes from orthogonal designs, IEEE Trans. Inf. Theory 45 (1999) 1456-1467. [26]]). Since then many other generalizations of Hadamard matrices have been introduced, including some discussed herein. In the same spirit we introduce a new object showing this kind of promise.Seberry's contributions to this field are not limited to her own work, of which orthogonal designs are but one example—she has mentored many young mathematicians who have expanded her legacy by making their own marks in this field. It is fitting, therefore, that our contribution to this volume is a collaboration between one who has worked in this field for over a decade and an undergraduate student who had just completed his third year of study at the time of the work.     

Generalized Hadamard matrices whose transposes are not generalized Hadamard matrices

In answer to “Research Problem 16” in Horadam's recent book Hadamard matrices and their applications, we provide a construction for generalized Hadamard matrices whose transposes are not generalized Hadamard matrices. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 456–458, 2009     

Rectangular Hadamard matrices

A method for the construction of v × b matrices with elements 1, −1, such that XX′ = bI, is given.     

Equiangular tight frames from complex Seidel matrices containing cube roots of unity

We derive easily verifiable conditions which characterize when complex Seidel matrices containing cube roots of unity have exactly two eigenvalues. The existence of such matrices is equivalent to the existence of equiangular tight frames for which the inner product between any two frame vectors is always a common multiple of the cube roots of unity. We also exhibit a relationship between these equiangular tight frames, complex Seidel matrices, and highly regular, directed graphs. We construct examples of such frames with arbitrarily many vectors.     

Equiangular tight frames

A survey on equiangular tight frames in the space is presented. Several equivalent definitions of a tight frame are given. The construction of the Mercedes–Benz frame, the well-known example of a tight frame on the plane, is generalized to the space . The existence problems for the Mercedes–Benz systems and other more general equiangular tight frames are discussed. It is shown that the Welch inequality becomes the equality only on equiangular tight frames (if they exist). Necessary and sufficient conditions for the existence of an equiangular tight (n,m)-frame are formulated in terms of the so-called signature matrices. All the main results are completely proved. Bibliography: 37 titles. Illustrations: 3 figures. Translated from Problems in Mathematical Analysis 39 February, 2009, pp. 3–25.     

Special tight frames

Special vector systems, in which every element is the preceding element multiplied by a unitary matrix U, are introduced. Necessary and sufficient conditions for such a system to be a tight frame are obtained (Theorem 1). Examples illustrating the necessity of every condition are given. The theorem is applied to the Mercedes-Benz frame. Let P denote the matrix composed of orthonormal eigenvectors of U. A new system of vectors in which every element equals the corresponding element of the initial system multiplied by P* is considered. It is proved that this system is a generalized harmonic frame if and only if the assumptions of Theorem 1 hold. This result is applied to show how to transform the Mercedes-Benz frame into a generalized harmonic frame.     

Prime tight frames

We introduce a class of finite tight frames called prime tight frames and prove some of their elementary properties. In particular, we show that any finite tight frame can be written as a union of prime tight frames. We then characterize all prime harmonic tight frames and use thischaracterization to suggest effective analysis and synthesis computation strategies for such frames. Finally, we describe all prime frames constructed from the spectral tetris method, and, as a byproduct, we obtain a characterization of when the spectral tetris construction works for redundancies below two.     

Expansion of frames to tight frames

We show that every Bessel sequence （and therefore every frame） in a separable Hilbert space can be expanded to a tight frame by adding some elements. The proof is based on a recent generalization of the frame concept, the g-frame, which illustrates that g-frames could be useful in the study of frame theory. As an application, we prove that any Gabor frame can be expanded to a tight frame by adding one window function.     

Hadamard matrices and difference families

Translated from Matematicheskie Zametki, Vol. 47, No. 3, pp. 11–16, March, 1990.     

Hadamard matrices and projective planes

The construction of a Hadamard matrix of order n² from a projective plane of order n, n even, is given. Alternative constructions, specialized to the case n = 10, from sets of mutually orthogonal Latin squares are also given. Special properties of the Hadamard matrices are discussed and a partial example is given in the case n = 10.     

Multilevel and multidimensional Hadamard matrices

Multilevel Hadamard matrices (MHMs), whose entries are integers as opposed to the traditional restriction to {±1}, were introduced by Trinh, Fan, and Gabidulin in 2006 as a way to construct multilevel zero-correlation zone sequences, which have been studied for use in approximately synchronized code division multiple access systems. We answer the open question concerning the maximum number of distinct elements permissible in an order n MHM by proving the existence of an order n MHM with n elements of distinct absolute value for all n. We also define multidimensional MHMs and prove an analogous existence result.