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

Abstract

Let B be the set of odd integers that are sums of two coprime squares. We prove that the trigonometric polynomial S(α;N)=Σb∈ B,b≤ N e(bα) satisfies \[ S(α; N)N/ N<<A,A' 1φ(q) + qN( N)7 +1( N)A \] for any A,A'≥ 0 and when (a,q)=1 and |qα-a|≤ ( 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 N as a sum b+b1+b2, where b∈ B while b1 (resp. b2) belongs to a general subset B1 (resp. B2) of B of relative positive density. We further show that the above bound is effective when 0≤ A<1/2.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…