Detecting Fourier subspaces
DOI10.1007/s00041-015-9444-8zbMath1356.43002arXiv1503.06893OpenAlexW2964089466MaRDI QIDQ305684
Charles A. Akemann, Nikolai Weaver
Publication date: 30 August 2016
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.06893
Fourier transformsignal detectionfinite abelian groupsKadison-Singersmall subspaces spanned by characters
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General theory of (C^*)-algebras (46L05) Enumerative combinatorics (05A99) Irregularities of distribution, discrepancy (11K38) Fourier and Fourier-Stieltjes transforms on locally compact and other abelian groups (43A25)
Cites Work
- Unnamed Item
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Ramanujan Graphs and the Solution of the Kadison-Singer Problem
- A Lyapunov-type theorem from Kadison-Singer
This page was built for publication: Detecting Fourier subspaces