Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I need some clarification on the following, if possible: I have seen in that for every $ f \in S_k$ which Fourier transform is $\sum_{n=1}^\infty a(n)q^n$ there is an upper bound $\sum_{n=1}^N \|a(n)\| \leq c_f \cdot N^{\frac{k+1}{2}} $.
Now, somehow, using the theorem that states $ \| \sum_{n=1}^N a(n) \| \leq c_f \cdot N^{\frac{k}{2}} \cdot logN $ we've got that there are a lot of sign changes in the coefficients. I can't see how it follows, as it wasn't stated anywhere that the first bound is tight.
Can someone explain how this result is obtained? And maybe give me some reference to literature on the topic (if exists), of advanced undergraduate - beginner graduate level?

Thanks in advance.

share|cite|improve this question
See this question… and this answer… ... they may help. – Álvaro Lozano-Robledo Aug 25 '11 at 0:56
up vote 2 down vote accepted

In lieu of another answer, I'd wager that the Iwaniec-Kowalski book "Analytic Number Theory" (AMS) would provide you with prototypes for many such arguments.

share|cite|improve this answer
I would even suggest to look at Section 14.9 first. – Álvaro Lozano-Robledo Aug 25 '11 at 0:54

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.