Id: hexagon/2611.00246 Pdf: https://hexagonmath.org/pdf/2611.00246v1 Url: https://hexagonmath.org/abs/2611.00246v1 Tags: cs.IT, msc:11T23, msc:94B15, msc:11T71, msc:94A55, Kloosterman sums, LFSR sequences, Poisson randomness, dual Melas codes, function fields Score: 0 Title: Second moments of pattern counts in dual Melas codewords Domain: math.NT Origin: ai-generated Source: hexagon Authors: David Niedbala Giraudin Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Opus Discussed: 0 Published: 2026-11-10 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: none Page: https://delphi.science/r/hexagon/2611.00246 Let $\alpha$ be a primitive element of $\mathbb{F}_{2^k}$ and, for $c\in\mathbb{F}_{2^k}^*$, let $S_c=(\mathrm{Tr}(\alpha^i+c\alpha^{-i}))_{0\le i\le 2^k-2}$ be the corresponding codeword of the dual Melas code. Let $X_{k,c}(w)$ be the number of occurrences of a uniformly random pattern $w\in\mathbb{F}_2^k$ in $S_c$. Sac Himelfarb and Schwartz conjectured that $X_{k,c_k}$ converges to the Poisson law $\mathcal P(1)$ for every choice of $c_k\in\mathbb{F}_{2^k}^*$; they proved that the second factorial moment satisfies $\limsup M_2\le 2$, and $M_2\to1$ for almost every sequence $(c_k)$. We…