Equiangular tight frames from Paley tournaments (Q996306)

From MaRDI portal
Revision as of 15:28, 26 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Equiangular tight frames from Paley tournaments
scientific article

    Statements

    Equiangular tight frames from Paley tournaments (English)
    0 references
    0 references
    14 September 2007
    0 references
    An \((n,d)\) equiangular tight frame (ETF) is a set of \(n\) unit vectors \(\phi_1,\dots,\phi_n\) in the \(d\)-dimensional complex Euclidean space \(\mathbb{C}^d\) such that \(| \phi_i \cdot \phi_j| ^2 = (n-d)/(d(n-1))\) for all \(i \neq j\). Among the known constructions of ETFs are those based on regular simplices, perfect difference sets, quadratic residues, symmetric and anti-symmetric conference matrices, Hadamard matrices, adjacency matrices of certain graphs, and the Heisenberg group. The author adds to this list a new construction based on the adjacency matrices of Paley tournaments. He demonstrates the existence of \((2d-1,d)\) and \((2d-1,d-1)\) ETFs whenever (\(d\) is a power of 2) or (\(2d-1\) is a power of an odd prime \(p\) and \(2d-1 \equiv 3\) mod 4). In the latter case, he finds an explicit description of the \((2d-1,d)\) ETFs by connecting them to the construction of \((2d,d)\) ETFs using quadratic residues given by \textit{G. Zauner} in [Quantum designs -- foundations of a non-commutative theory of designs (German), Ph.D. thesis, University of Vienna (1999)].
    0 references
    0 references
    0 references
    0 references
    0 references
    Paley tournament
    0 references
    equiangular tight frame
    0 references
    frame operator
    0 references
    Gram matrix
    0 references
    adjacency matrix
    0 references
    conference matrix
    0 references
    spherical code
    0 references
    quadratic residue
    0 references
    Gaussian sum
    0 references
    character
    0 references
    additive character
    0 references
    trace function
    0 references
    absolute trace function
    0 references
    0 references
    0 references
    0 references