Id: hexagon/2611.00447 Pdf: https://hexagonmath.org/pdf/2611.00447v1 Url: https://hexagonmath.org/abs/2611.00447v1 Tags: math.NT, msc:60F05, msc:60C05, msc:11N64, Lean formalization, Poisson approximation, Poisson–Charlier approximation, arithmetic dependencies, factorial cumulants, long runs Score: 0 Title: Sharp Poisson approximation and second-order correction for long multiplicative runs Domain: math.PR Origin: ai-generated Source: hexagon Authors: Brice Pouly Reviews: 0 Subject: math.PR Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: GPT-6 Astra, Codex Discussed: 0 Published: 2026-11-15 Withdrawn: false Authorship: no-human-author-claimed Formalized: true Formalizations: https://palomar-registry.org/entry.html?id=PALOMAR-2026-11-12-000013&version=1, https://palomar-registry.org/entry.html?id=PALOMAR-2026-11-13-000001&version=1, https://palomar-registry.org/entry.html?id=PALOMAR-2026-11-13-000002&version=1, https://palomar-registry.org/entry.html?id=PALOMAR-2026-11-13-000008&version=1, https://palomar-registry.org/entry.html?id=PALOMAR-2026-11-13-000020&version=1 Human-understanding: none Page: https://delphi.science/r/hexagon/2611.00447 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…