Lattices from tight frames and vertex transitive graphs
From MaRDI portal
Publication:2325750
zbMath1443.11131arXiv1902.02862MaRDI QIDQ2325750
Lenny Fukshansky, Josiah Park, Yuxin Xin, Deanna Needell
Publication date: 30 September 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.02862
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) General harmonic expansions, frames (42C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Graph operations (line graphs, products, etc.) (05C76)
Related Items
On the geometry of nearly orthogonal lattices, Groups of orthogonal matrices all orbits of which generate lattices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimation of Laplacian spectra of direct and strong product graphs
- A mathematical introduction to compressive sensing
- Lattices from equiangular tight frames
- Spectra of graphs
- Steiner equiangular tight frames
- A simple proof of the restricted isometry property for random matrices
- Spherical codes and designs
- PROMP: a sparse recovery approach to lattice-valued signals
- An introduction to finite tight frames
- Vertex-transitive direct products of graphs
- An algebraic perspective on integer sparse recovery
- Probability of unique integer solution to a system of linear equations
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- Addendum to: ``Lattices from equiangular tight frames
- Bases of minimal vectors in lattices. II
- Theory and applications of compressed sensing
- Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Spatial Compressive Sensing for MIMO Radar
- Topics on Mathematical Crystallography
- Strongly Regular Graphs Derived from Combinatorial Designs
- A Class of Nonharmonic Fourier Series
- Geometry of cuts and metrics
