Translates of completely normal elements and the Morgan–Mullen conjecture: unproved cases, corrected thresholds, and complete restoration

Paper, verification programs and data for an audit of T. Garefalakis and G. Kapetanakis, "Translates of completely normal elements and the Morgan–Mullen conjecture", Canad. Math. Bull., published online 28 May 2026 (doi:10.4153/S0008439526102082, arXiv:2509.23245). That paper proves the existence of primitive completely normal elements in (n1, n2)-partially completely basic extensions F_{q^n}/F_q for n1 = 2, 3 (Theorem 7.2(1)). Two families with q = 2 claimed by the theorem are not covered by its proof: 1. q = 2, n1 = 2. The computation discards every n2 by a parity argument that confuses p | n2 with p | n; 63 extensions were never tested. They satisfy the paper's own test.2. q = 2, n1 = 3, n odd. The method of the paper gives nothing here, yet the theorem contains these infinitely many extensions. We show that ab + a + a^2 is completely normal when a and b are completely normal in F_{2^n1} and F_{2^n2} and gcd(n2, ord_{n1}(2)) = 1, which gives the same sufficient condition as for n even. Both families are proved, so Theorem 7.2(1) holds as stated. The note also recomputes Table 1 of the paper and explains its discrepant entries, gives effective thresholds for the asymptotic Theorem 6.4, completes the unfinished computation for n1 = 4, n2 ≥ 256, and corrects Remark 5.1. Contents: the note (LaTeX source and PDF), the verification program (Python 3; sympy, numpy, mpmath), the script producing the figure, and the output data (JSON files and a text log). A full run takes about five minutes and regenerates all data. See README.md for the correspondence between program sections, statements of the note and data files. Source repository: https://github.com/Ruqing1963/kapetanakis-translates-cmb-audit

Authors

Publication Details

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

Translates of completely normal elements and the Morgan–Mullen conjecture: unproved cases, corrected thresholds, and complete restoration

Ruqing Chen
Zenodo (CERN European Organization for Nuclear Research)
Coding theory and cryptography
preprint

Translates of completely normal elements and the Morgan–Mullen conjecture: unproved cases, corrected thresholds, and complete restoration

Ruqing Chen
preprint en

Abstract

Paper, verification programs and data for an audit of T. Garefalakis and G. Kapetanakis, "Translates of completely normal elements and the Morgan–Mullen conjecture", Canad. Math. Bull., published online 28 May 2026 (doi:10.4153/S0008439526102082, arXiv:2509.23245). That paper proves the existence of primitive completely normal elements in (n1, n2)-partially completely basic extensions F_{q^n}/F_q for n1 = 2, 3 (Theorem 7.2(1)). Two families with q = 2 claimed by the theorem are not covered by its proof: 1. q = 2, n1 = 2. The computation discards every n2 by a parity argument that confuses p | n2 with p | n; 63 extensions were never tested. They satisfy the paper's own test.2. q = 2, n1 = 3, n odd. The method of the paper gives nothing here, yet the theorem contains these infinitely many extensions. We show that ab + a + a^2 is completely normal when a and b are completely normal in F_{2^n1} and F_{2^n2} and gcd(n2, ord_{n1}(2)) = 1, which gives the same sufficient condition as for n even. Both families are proved, so Theorem 7.2(1) holds as stated. The note also recomputes Table 1 of the paper and explains its discrepant entries, gives effective thresholds for the asymptotic Theorem 6.4, completes the unfinished computation for n1 = 4, n2 ≥ 256, and corrects Remark 5.1. Contents: the note (LaTeX source and PDF), the verification program (Python 3; sympy, numpy, mpmath), the script producing the figure, and the output data (JSON files and a text log). A full run takes about five minutes and regenerates all data. See README.md for the correspondence between program sections, statements of the note and data files. Source repository: https://github.com/Ruqing1963/kapetanakis-translates-cmb-audit

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