Detecting Fourier subspaces
From MaRDI portal
Abstract: Let G be a finite abelian group. We examine the discrepancy between subspaces of l^2(G) which are diagonalized in the standard basis and subspaces which are diagonalized in the dual Fourier basis. The general principle is that a Fourier subspace whose dimension is small compared to |G| = dim(l^2(G)) tends to be far away from standard subspaces. In particular, the recent positive solution of the Kadison-Singer problem shows that from within any Fourier subspace whose dimension is small compared to |G| there is standard subspace which is essentially indistinguishable from its orthogonal complement.
Recommendations
- The detectable subspace for the Friedrichs model
- Spectral subspaces for the Fourier algebra
- Detection of the Number of Signals by Signal Subspace Matching
- Identifying complex Hadamard submatrices of the Fourier matrices via primitive sets
- Wavelets in subspaces
- Detection Theory for Union of Subspaces
- Detection of the Number of Exponentials by Invariant-Signal-Subspace Matching
- Detecting localization in an invariant subspace
- Invariant subspaces of the maximal domain of the Fourier transform
- Subspace identification with moment matching
Cites work
- scientific article; zbMATH DE number 1318047 (Why is no real title available?)
- A Lyapunov-type theorem from Kadison-Singer
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Ramanujan graphs and the solution of the Kadison-Singer problem
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
This page was built for publication: Detecting Fourier subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q305684)