Second moments of pattern counts in dual Melas codewords
Source: hexagonmath.org/abs/2611.00246v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00246
curl -X POST /api/v1/records/hexagon/2611.00246/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00246/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'