On the construction of equiangular frames from graphs

DOI10.1016/j.laa.2009.07.016zbMath1216.05079OpenAlexW1996425172MaRDI QIDQ734936

Shayne F. D. Waldron

Publication date: 14 October 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.07.016

zbMATH Keywords

adjacency matrixinformation theorysignal processingalgebraic graph theorySeidel matrixtight framemutually unbiased basisfinite frameGrassmannian frametwo angle frame

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Communication, information (94A99) General harmonic expansions, frames (42C15) Symmetry properties of polytopes (52B15)

Related Items (42)

Robust Eigenvectors of Symmetric Tensors ⋮ Properties of real and complex ETFs and their application to the design of low coherence frames ⋮ Upper bounds for \(s\)-distance sets and equiangular lines ⋮ Properties of certain multi-angle tight frames in \(\mathbb{R}^d\) ⋮ Deterministic bounds for restricted isometry in compressed sensing matrices ⋮ On maximal relative projection constants ⋮ Equiangular tight frames that contain regular simplices ⋮ Frames of uniform subframe bounds with applications to erasures ⋮ Killing metrized commutative nonassociative algebras associated with Steiner triple systems ⋮ Hadamard equiangular tight frames ⋮ Tremain equiangular tight frames ⋮ Saturated configuration and new large construction of equiangular lines ⋮ Equiangular tight frames and signature sets in groups ⋮ Equiangular tight frames from group divisible designs ⋮ Equiangular tight frames with centroidal symmetry ⋮ The entanglement criteria based on equiangular tight frames ⋮ DCACO: an algorithm for designing incoherent redundant matrices ⋮ Bounds for the sum of distances of spherical sets of small size ⋮ Constructions and restrictions for balanced splittable Hadamard matrices ⋮ Numerically erasure-robust frames ⋮ Low coherence unit norm tight frames ⋮ The road to deterministic matrices with the restricted isometry property ⋮ Equiangular frames and generalizations of the Welch bound to dual pairs of frames ⋮ Steiner equiangular tight frames ⋮ Grassmannian codes from paired difference sets ⋮ Doubly transitive lines. I: Higman pairs and roux ⋮ Frame graph ⋮ Geometry of the Welch bounds ⋮ The symmetry group of a finite frame ⋮ Equiangular lines and the Lemmens-Seidel conjecture ⋮ Packings in Real Projective Spaces ⋮ Harmonic equiangular tight frames comprised of regular simplices ⋮ New Upper Bounds for Equiangular Lines by Pillar Decomposition ⋮ Bounds on antipodal spherical designs with few angles ⋮ Equiangular tight frames and unistochastic matrices ⋮ Construction ofk-Angle Tight Frames ⋮ Determinantal sampling designs ⋮ Frames over finite fields: equiangular lines in orthogonal geometry ⋮ Regular two-distance sets ⋮ Polyphase equiangular tight frames and abelian generalized quadrangles ⋮ Finite two-distance tight frames ⋮ Equiangular Frames and Their Duals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complex equiangular cyclic frames and erasures
• Geometric properties of Grassmannian frames for \(\mathbb R^2\) and \(\mathbb R^3\)
• Equiangular tight frames from complex Seidel matrices containing cube roots of unity
• On the existence of equiangular tight frames
• Grassmannian frames with applications to coding and communication
• Optimal frames for erasures.
• Frames, graphs and erasures
• Finite Fields and Applications
• Symmetric informationally complete quantum measurements
• An introduction to frames and Riesz bases
• Quantized frame expansions with erasures

This page was built for publication: On the construction of equiangular frames from graphs