arXiv Analytics

Sign in

arXiv:2107.10348 [math.CA]AbstractReferencesReviewsResources

How many Fourier coefficients are needed?

Mihail N. Kolountzakis, Effie Papageorgiou

Published 2021-07-21Version 1

We are looking at families of functions or measures on the torus (in dimension one and two) which are specified by a finite number of parameters $N$. The task, for a given family, is to look at a small number of Fourier coefficients of the object, at a set of locations that is predetermined and may depend only on $N$, and determine the object. We look at (a) the indicator functions of at most $N$ intervals of the torus and (b) at sums of at most $N$ complex point masses on the two-dimensional torus. In the first case we reprove a theorem of Courtney which says that the Fourier coefficients at the locations $0, 1, \ldots, N$ are sufficient to determine the function (the intervals). In the second case we produce a set of locations of size $O(N \log N)$ which suffices to determine the measure.

Comments: 16 pages, 1 figure
Categories: math.CA, cs.NA, math.NA
Subjects: 41A05, 41A27, 42A15, 42A16
Related articles: Most relevant | Search more
arXiv:1508.06673 [math.CA] (Published 2015-08-26)
Change of variable and the rapidity of decrease of Fourier coefficients
arXiv:math/0611362 [math.CA] (Published 2006-11-13)
On Relations among Fourier Coefficients and Sum-functions
arXiv:1312.0464 [math.CA] (Published 2013-12-02, updated 2013-12-03)
A Mixed Parseval-Plancherel Formula