Frobenius orbit counting and congruences for the moments of the differential spectrum of x^(p^j+2)

Let p be an odd prime, q = p^n, and F(x) = x^(p^j+2) over F_q with gcd(j,n) = 1. For the differential spectrum N(b) = #{x : F(x+1) - F(x) = b} we study all moments S_r = sum_b N(b)^r through tuple counts T_k obtained by a Stirling-type inversion. We prove: (A) T_k(j) is invariant modulo (p-1) 2^(k-1) k!; (B/C) an extra factor l appears for every odd prime l dividing n with l not dividing p-1 and k < l (comparing j = j' mod n/l); (F) an exact formula for the residue modulo l for every k, as a count of fixed points of a twisted Frobenius action, including the twisted case l | p-1; (G) for n = 3 all twisted fibres have size at most 2, via the factorisation (x - kappa^2)^4 of an elimination quartic. All statements were pre-registered and tested blind on configurations never computed before: 382 blind checks in 17 registered tests, no failure (counts recomputed from the deposited data by count_blind.py). The archive contains the paper, code with built-in controls, the 17 pre-registration specs, all raw outputs, SHA256SUMS, and the AI referee reports with responses. Status: reviewed by AI referees only; no human expert review yet.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-12
DOI
https://doi.org/10.5281/zenodo.24160457
Primary Topic
Coding theory and cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Frobenius orbit counting and congruences for the moments of the differential spectrum of x^(p^j+2)

Vichien Fugsukjit
Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
preprint

Frobenius orbit counting and congruences for the moments of the differential spectrum of x^(p^j+2)

Vichien Fugsukjit
preprint en

Abstract

Let p be an odd prime, q = p^n, and F(x) = x^(p^j+2) over F_q with gcd(j,n) = 1. For the differential spectrum N(b) = #{x : F(x+1) - F(x) = b} we study all moments S_r = sum_b N(b)^r through tuple counts T_k obtained by a Stirling-type inversion. We prove: (A) T_k(j) is invariant modulo (p-1) 2^(k-1) k!; (B/C) an extra factor l appears for every odd prime l dividing n with l not dividing p-1 and k < l (comparing j = j' mod n/l); (F) an exact formula for the residue modulo l for every k, as a count of fixed points of a twisted Frobenius action, including the twisted case l | p-1; (G) for n = 3 all twisted fibres have size at most 2, via the factorisation (x - kappa^2)^4 of an elimination quartic. All statements were pre-registered and tested blind on configurations never computed before: 382 blind checks in 17 registered tests, no failure (counts recomputed from the deposited data by count_blind.py). The archive contains the paper, code with built-in controls, the 17 pre-registration specs, all raw outputs, SHA256SUMS, and the AI referee reports with responses. Status: reviewed by AI referees only; no human expert review yet.

Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon