Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I've asked the background question here, which still left unanswered. Now I have a more precise question. In my homework I've been asked to prove that $$\left| \sum_{1\leq n \leq N} a_f (n)e^{2\pi i n \alpha}\right| \leq c_f N^{k\over 2}\log N $$ for any $ f \in S_k $ where $ f(\tau) = \sum\limits_{n=1}^\infty a_f (n)q^n $, any real $ \alpha $ and any $ N \geq 10 $.
That one I have proved. Now I have to deduce that we have the same bound for the coefficients restricted to any arithmetic progression - that is for any $ 1 \leq q \in \mathbb Z $ and $ a \pmod q$ , we have: $$\left| \sum_{1 \leq n \leq N , n \equiv a \pmod q} a_f (n)\right| \leq c_f N^{k \over 2} \log N .$$

Can someone give me a hint on that one? I know that coefficients may change signs and I don't really know when, so a subset of them may sum to something larger.

share|improve this question

1 Answer 1

see "The average value of Fourier coefficients of cusp forms in arithmetic progressions " http://www.sciencedirect.com/science/article/pii/S0022314X0800156X

share|improve this answer
    
Link-only answers, especially to your own papers in commercial journals are not all that useful. Especially to questions that are two and a half years old. Please expand your answer to make it self-contaned. –  mrf Oct 4 '13 at 21:43

Your Answer

 
discard

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.