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

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Equiangular tight frames from complex Seidel matrices containing cube roots of unity
    scientific article

      Statements

      Equiangular tight frames from complex Seidel matrices containing cube roots of unity (English)
      0 references
      0 references
      0 references
      0 references
      2 December 2008
      0 references
      A set \(\{f_i\}_{1\leq i\leq n}\) in the complex Hilbert space \(\mathbb{C}^k\) is a uniform \((n,k)\)-frame if for all \(x\in \mathbb{C}^k\) \[ \| x\|^2= \sum^n_{i=1} |\langle x,f_i\rangle|^2, \] and for all \(i\), \(\| f_i\|= a\neq 0\). The class of these is denoted by \({\mathcal F}(n,k)\) while \({\mathcal F}_{\text{eq}}(n,k)\) stands for its subclass formed by equivangular frames, i.e., satisfying for some constant \[ |\langle f_i, f_j\rangle|= \text{const}\text{ for all }i\neq j. \] Using the analysis operator \(V: x\mapsto (\langle x,f_i\rangle)_{1\leq i\leq n}\) one can associate to \(\{f_i\}_{1\leq i\leq n}\) the Grammian \(V^*V\). This is a one-to-one correspondence between \({\mathcal F}(k,n)\) and the class of J\(n\times n\) Grammians factorized by unitary equivalence. If \(G\) is such a Grammian, then \[ G= {k\over n} Jd_n+ c_{n,k} Q, \] where \(Q\) is a Seidel matrix, i.e. a self-adjoint matrix such that \(Q_{ii}= 0\) and \(|Q_{ij}|= 1\) for \(i\neq j\). The starting point for the authors study is the following: a frame \(\{f_i\}_{1\leq i\leq n}\) from \({\mathcal F}(k,n)\) is equiangular if and only if the associated Seidel matrix has exactly two eigenvalues.
      0 references
      tight frame
      0 references
      equiangular frame
      0 references
      Grammian
      0 references
      Seidel matrix
      0 references
      eigenvalue
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references