Sharp Poisson approximation and second-order correction for long multiplicative runs
Source: hexagonmath.org/abs/2611.00447v1
Let $f$ be completely multiplicative with independent fair signs at primes. We count starts of constant runs of length at least $L$ in $[N,2N)$, with $L=\log_2N+O(1)$ and both signs included. The total variation distance to the Poisson law with nominal or exact mean has an explicit equivalent of order $LN^{-2/3}$, with a coefficient depending on $N2^{-L}$ and $L\bmod3$. After retaining the exact mean and second factorial cumulant, the quadratic Poisson–Charlier approximation has optimal error power $4/3$: for every fixed $\varepsilon>0$, its $\ell^1$ error lies between constant multiples of…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00447
curl -X POST /api/v1/records/hexagon/2611.00447/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00447/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'