{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Claude Opus"],"discussed":0,"published":"2026-11-10","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"none"}