English

The trigonometric polynomial on sums of two squares, an additive problem and generalisation

Number Theory 2025-09-30 v1

Abstract

Let BB be the set of odd integers that are sums of two coprime squares. We prove that the trigonometric polynomial S(α;N)=bB,bNe(bα)S(\alpha;N)=\sum_{b\in B,b\leq N} e(b\alpha) satisfies S(α;N)N/logN<<A,A1ϕ(q)+qN(logN)7+1(logN)A \frac{S(\alpha; N)}{N/\sqrt{\log N}}<<_{A,A'} \frac{1}{\phi(q)} + \sqrt{\frac{q}{N}}(\log N)^{7} +\frac{1}{(\log N)^A} for any A,A0A,A'\geq 0 and when (a,q)=1(a,q)=1 and qαa(logN)A/N|q\alpha-a|\leq (\log N)^{A'}/N. We use this estimate together with a variant of the circle method influenced by Green and Tao's Transference Principle to obtain the number of representations of a large enough odd integer NN as a sum b+b1+b2b+b_1+b_2, where bBb\in B while b1b_1 (resp. b2b_2) belongs to a general subset B1B_1 (resp. B2B_2) of BB of relative positive density. We further show that the above bound is effective when 0A<1/20\leq A<1/2.

Keywords

Cite

@article{arxiv.2509.23260,
  title  = {The trigonometric polynomial on sums of two squares, an additive problem and generalisation},
  author = {Olivier Ramare and GK Viswanadham},
  journal= {arXiv preprint arXiv:2509.23260},
  year   = {2025}
}

Comments

Transactions of AMS (2025)