Equi-isoclinic subspaces, covers of the complete graph, and complex conference matrices

12/23/2022
by   Matthew Fickus, et al.
0

In 1992, Godsil and Hensel published a ground-breaking study of distance-regular antipodal covers of the complete graph that, among other things, introduced an important connection with equi-isoclinic subspaces. This connection seems to have been overlooked, as many of its immediate consequences have never been detailed in the literature. To correct this situation, we first describe how Godsil and Hensel's machine uses representation theory to construct equi-isoclinic tight fusion frames. Applying this machine to Mathon's construction produces q+1 planes in ℝ^q+1 for any even prime power q>2. Despite being an application of the 30-year-old Godsil-Hensel result, infinitely many of these parameters have never been enunciated in the literature. Following ideas from Et-Taoui, we then investigate a fruitful interplay with complex symmetric conference matrices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2021

On Some Bounds on the Perturbation of Invariant Subspaces of Normal Matrices with Application to a Graph Connection Problem

We provide upper bounds on the perturbation of invariant subspaces of no...
research
03/21/2019

Harmonic equiangular tight frames comprised of regular simplices

An equiangular tight frame (ETF) is a sequence of unit-norm vectors in a...
research
06/23/2018

Doubly transitive lines I: Higman pairs and roux

We study lines through the origin of finite-dimensional complex vector s...
research
07/09/2020

Scattered subspaces and related codes

After a seminal paper by Shekeey (2016), a connection between maximum h-...
research
10/01/2013

Graph connection Laplacian and random matrices with random blocks

Graph connection Laplacian (GCL) is a modern data analysis technique tha...
research
12/28/2021

Harmonic Grassmannian codes

An equi-isoclinic tight fusion frame (EITFF) is a type of Grassmannian c...
research
09/05/2020

Explicit near-fully X-Ramanujan graphs

Let p(Y_1, …, Y_d, Z_1, …, Z_e) be a self-adjoint noncommutative polynom...

Please sign up or login with your details

Forgot password? Click here to reset