The Fourier Ratio and complexity of signals
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911284366147584 |
|---|---|
| author | Aldaleh, K. Burstein, W. Garza, G. Hart, G. Iosevich, A. Iosevich, J. Khalil, A. King, J. Kulkarni, N. Le, T. Li, I. Mayeli, A. McDonald, B. Nguyen, K. Shaffer, N. |
| author_facet | Aldaleh, K. Burstein, W. Garza, G. Hart, G. Iosevich, A. Iosevich, J. Khalil, A. King, J. Kulkarni, N. Le, T. Li, I. Mayeli, A. McDonald, B. Nguyen, K. Shaffer, N. |
| contents | We study the Fourier ratio of a signal $f:\mathbb Z_N\to\mathbb C$, \[ \mathrm{FR}(f)\ :=\ \sqrt{N}\,\frac{\|\widehat f\|_{L^1(μ)}}{\|\widehat f\|_{L^2(μ)}} \ =\ \frac{\|\widehat f\|_1}{\|\widehat f\|_2}, \] as a simple scalar parameter governing Fourier-side complexity, structure, and learnability. Using the Bourgain--Talagrand theory of random subsets of orthonormal systems, we show that signals concentrated on generic sparse sets necessarily have large Fourier ratio, while small $\mathrm{FR}(f)$ forces $f$ to be well-approximated in both $L^2$ and $L^\infty$ by low-degree trigonometric polynomials. Quantitatively, the class $\{f:\mathrm{FR}(f)\le r\}$ admits degree $O(r^2)$ $L^2$-approximants, which we use to prove that small Fourier ratio implies small algorithmic rate--distortion, a stable refinement of Kolmogorov complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_19560 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Fourier Ratio and complexity of signals Aldaleh, K. Burstein, W. Garza, G. Hart, G. Iosevich, A. Iosevich, J. Khalil, A. King, J. Kulkarni, N. Le, T. Li, I. Mayeli, A. McDonald, B. Nguyen, K. Shaffer, N. Classical Analysis and ODEs Information Theory We study the Fourier ratio of a signal $f:\mathbb Z_N\to\mathbb C$, \[ \mathrm{FR}(f)\ :=\ \sqrt{N}\,\frac{\|\widehat f\|_{L^1(μ)}}{\|\widehat f\|_{L^2(μ)}} \ =\ \frac{\|\widehat f\|_1}{\|\widehat f\|_2}, \] as a simple scalar parameter governing Fourier-side complexity, structure, and learnability. Using the Bourgain--Talagrand theory of random subsets of orthonormal systems, we show that signals concentrated on generic sparse sets necessarily have large Fourier ratio, while small $\mathrm{FR}(f)$ forces $f$ to be well-approximated in both $L^2$ and $L^\infty$ by low-degree trigonometric polynomials. Quantitatively, the class $\{f:\mathrm{FR}(f)\le r\}$ admits degree $O(r^2)$ $L^2$-approximants, which we use to prove that small Fourier ratio implies small algorithmic rate--distortion, a stable refinement of Kolmogorov complexity. |
| title | The Fourier Ratio and complexity of signals |
| topic | Classical Analysis and ODEs Information Theory |
| url | https://arxiv.org/abs/2511.19560 |