SearcharxivSearch

arXiv subjects

John I. Haas

Publications and source records attributed to John I. Haas.

5 recordsLinked to original sources

Constructions and properties of optimally spread subspace packings via symmetric and affine block designs and mutually unbiased bases

We continue the study of optimal chordal packings, with emphasis on packing subspaces of dimension greater than one. Following a principle outlined in a previous work, where the authors use maximal affine block designs and maximal sets of mutually unbiased bases to construct Grassmannian $2$-designs, we show that their method extends to other types of block designs, leading to a plethora of optimal subspace packings characterized by the orthoplex bound. More generally, we show that any optimal chordal packing is necessarily a fusion frame and that its spatial complement is also optimal.

math.FA

Toward the Classification of Biangular Harmonic Frames

Equiangular tight frames (ETFs) and biangular tight frames (BTFs) - sets of unit vectors with basis-like properties whose pairwise absolute inner products admit exactly one or two values, respectively - are useful for many applications. A well-understood class of ETFs are those which manifest as harmonic frames - vector sets defined in terms of the characters of finite abelian groups - because they are characterized by combinatorial objects called difference sets. This work is dedicated to the study of the underlying combinatorial structures of harmonic BTFs. We show that if a harmonic frame is generated by a divisible difference set, a partial difference set or by a special structure with certain Gauss summing properties - all three of which are generalizations of difference sets that fall under the umbrella term "bidifference set" - then it is either a BTF or an ETF. However, we also show that the relationship between harmonic BTFs and bidifference sets is not as straightforward as the correspondence between harmonic ETFs and difference sets, as there are examples of bidifference sets that do not generate harmonic BTFs. In addition, we study another class of combinatorial structures, the nested divisible difference sets, which yields an example of a harmonic BTF that is not generated by a bidifference set.

math.FA

Constructions of biangular tight frames and their relationships with equiangular tight frames

We study several interesting examples of Biangular Tight Frames (BTFs) - basis-like sets of unit vectors admitting exactly two distinct frame angles (ie, pairwise absolute inner products) - and examine their relationships with Equiangular Tight Frames (ETFs) - basis-like systems which admit exactly one frame angle. We demonstrate a smooth parametrization BTFs, where the corresponding frame angles transform smoothly with the parameter, which "passes through" an ETF answers two questions regarding the rigidity of BTFs. We also develop a general framework of so-called harmonic BTFs and Steiner BTFs - which includes the equiangular cases, surprisingly, the development of this framework leads to a connection with the famous open problem(s) regarding the existence of Mersenne and Fermat primes. Finally, we construct a (chordally) biangular tight set of subspaces (ie, a tight fusion frame) which "Plücker embeds" into an ETF.

math.FA

On the rigidity of geometric and spectral properties of Grassmannian frames

We study the rigidity properties of Grassmannian frames: basis-like sets of unit vectors that correspond to optimal Grassmannian line packings. It is known that Grassmannian frames characterized by the Welch bound must satisfy the restrictive geometric and spectral conditions of being both equiangular and tight; however, less is known about the necessary properties of other types of Grassmannian frames. We examine explicit low-dimensional examples of orthoplectic Grassmannian frames and conclude that, in general, the necessary conditions for the existence of Grassmannian frames can be much less restrictive. In particular, we exhibit a pair of $5$-element Grassmannian frames in $\mathbb C^2$ manifesting with differently sized angle sets and different reconstructive properties (ie, only one of them is a tight frame). This illustrates the complexity of the line packing problem, as there are cases where a solution may coexist with another solution of a different geometric and spectral character. Nevertheless, we find that these "twin" instances still respect a certain rigidity, as there is a necessary trade-off between their tightness properties and the cardinalities of their angle sets. The proof of this depends on the observation that the traceless embedding of Conway, Hardin and Sloane sends the vectors of a unit-norm, tight frame to a zero-summing set on a higher dimensional sphere. In addition, we review some of the known bounds for characterizing optimal line packings in $\mathbb C^2$ and discuss several examples of Grassmannian frames achieving them.

math.FA

Maximal Orthoplectic Fusion Frames from Mutually Unbiased Bases and Block Designs

The construction of optimal line packings in real or complex Euclidean spaces has shown to be a tantalizingly difficult task, because it includes the problem of finding maximal sets of equiangular lines. In the regime where equiangular lines are not possible, some optimal packings are known, for example, those achieving the orthoplex bound related to maximal sets of mutually unbiased bases. In this paper, we investigate the packing of subspaces instead of lines and determine the implications of maximality in this context. We leverage the existence of real or complex maximal mutually unbiased bases with a combinatorial design strategy in order to find optimal subspace packings that achieve the orthoplex bound. We also show that maximal sets of mutually unbiased bases convert between coordinate projections associated with certain balanced incomplete block designs and Grassmannian 2-designs. Examples of maximal orthoplectic fusion frames already appeared in the works by Shor, Sloane and by Zauner. They are realized in dimensions that are a power of four in the real case or a power of two in the complex case.

math.FA