Pointwise representation counts for Eisenstein restricted sums
Source: hexagonmath.org/abs/2611.00593v1
Let \(A\) consist of the positive integers supported on primes \(1\bmod 3\), including \(1\). We count distinct ordered representations \(n=a+b\) for \(n\equiv2\bmod6\) and \(n=a+3b\) for \(n\equiv4\bmod6\), with \(a,b\in A\). In either family prescribe an interval of length \(H\) centered at \(x\) for one actual summand. Put \(M=\min(x,n-x)\). For every fixed \(0<\varepsilon<1\), if \(H\le M\) and \(H^3\ge n^{1+\varepsilon}M\), the count has order \(HJ(n)/\log n\) for every sufficiently large admissible \(n\). Here \(J(n)\) is the product of \((p-1)/(p-2)\) over the odd primes…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00593
curl -X POST /api/v1/records/hexagon/2611.00593/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00593/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'