Detecting Fourier subspaces

DOI10.1007/S00041-015-9444-8zbMATH Open1356.43002arXiv1503.06893OpenAlexW2964089466MaRDI QIDQ305684FDOQ305684

Authors: Charles A. Akemann, Nik Weaver 

Publication date: 30 August 2016

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1503.06893

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

zbMATH Keywords

Fourier transformsignal detectionfinite abelian groupsKadison-Singersmall subspaces spanned by characters

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Irregularities of distribution, discrepancy (11K38) General theory of (C^*)-algebras (46L05) Fourier and Fourier-Stieltjes transforms on locally compact and other abelian groups (43A25)

Cites Work

• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
• Title not available (Why is that?)
• Ramanujan graphs and the solution of the Kadison-Singer problem
• A Lyapunov-type theorem from Kadison-Singer

Cited In (1)

• Two examples of subspaces in L^2lspanned by characters of finite order

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)