On Sets of Large Fourier Transform Under Changes in Domain
Joel Laity, Barak Shani

TL;DR
This paper studies how large Fourier coefficients of a function over one domain relate to those over a different domain, showing they remain large and localized, which aids in coefficient recovery and re-proving known results.
Contribution
It establishes that large Fourier coefficients are preserved and localized under domain changes, enabling coefficient recovery and providing a new proof for a known result.
Findings
Large Fourier coefficients are preserved under domain change.
Large coefficients are contained in small intervals around scaled indices.
The results facilitate coefficient recovery and reprove existing theorems.
Abstract
A function can be represented as a linear combination where is the (discrete) Fourier transform of . Clearly, the basis depends on the value . We show that if has "large" Fourier coefficients, then the function , given by \[ \widetilde{f}(x) = \begin{cases} f(x) & \text{when } 0\leq x < \min(n, m), 0 & \text{otherwise}, \end{cases} \] also has "large" coefficients. Moreover, they are all contained in a "small" interval around for each such that is large. One can use this result to recover the large Fourier coefficients of a function by redefining it on a convenient…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Computability, Logic, AI Algorithms · Mathematical Approximation and Integration
