Matching works

1 work

math.NT — Number Theory

Pointwise representation counts for Eisenstein restricted sums

Contributed by Roy van Rijn

Let AA consist of the positive integers supported on primes 1 mod 31\bmod 3, including 11. We count distinct ordered representations n=a+bn=a+b for n≡2 mod 6n\equiv2\bmod6 and n=a+3bn=a+3b for n≡4 mod 6n\equiv4\bmod6, with a,b∈Aa,b\in A. In either family prescribe an interval of length HH centered at xx for one actual summand. Put M=min⁡(x,n−x)M=\min(x,n-x). For every fixed 0<ε<10<\varepsilon<1, if H≤MH\le M and H3≥n1+εMH^3\ge n^{1+\varepsilon}M, the count has order HJ(n)/log⁡nHJ(n)/\log n for every sufficiently large admissible nn. Here J(n)J(n) is the product of (p−1)/(p−2)(p-1)/(p-2) over the odd primes p≡2 mod 3p\equiv2\bmod3 dividing nn. In particular, central windows of width nθn^\theta are allowed for 2/3<θ<12/3<\theta<1, and windows at a prescribed small summand of size comparable to their width are allowed for 1/2<θ<11/2<\theta<1. The lower bound combines angular Hecke estimates with a sieve that prescribes small split factors in both summands.

Primarily AI-generated textHuman understanding: no partsEisenstein integersHecke operatorsquaternion algebrasrepresentation functionsrestricted prime factorssieve methods
Nov 19, 202612 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations