A note on the existence of pairs of r-primitive and k-normal elements over finite fields

We revisit J. J. R. Aguirre and V. G. L. Neumann, "Pairs of r-primitive and k-normal elements in finite fields" (arXiv:2210.11504; Bull. Braz. Math. Soc. 2023). Its Theorem 3.2 gives an inequality which, for every rational function F in a class Υ_{q^n}(m1, m2), is said to guarantee an r1-primitive k1-normal element α with F(α) r2-primitive k2-normal. The class contains F = x + 1. For q = 2, n = 19, r_i = 1, k_i = 0 the inequality holds (2^9.5 ≈ 724 ≥ 128), but Tr(α + 1) = Tr(α) + 1, so α and α + 1 are never both normal. The same happens for F = x^2 + x. The proof leaves out the character-sum terms with η2 trivial and ψ2 nontrivial. For affine F these terms have size q^n, not O(q^{n/2}). The summary Theorem 4.8 fails in the same way: if p | n or gcd(n, q − 1) = 1, no affine F = ax + b maps a 2-normal element to a 1-normal one. At (q, n) = (5, 10) an exhaustive search over F_{5^10} finds that the 16 affine members of Υ_5(2, 1) give no pair, while each of the other 560 gives at least 3800. We state corrected theorems, adding a nondegeneracy condition (ND) that excludes Artin–Schreier forms h^p − h + c. We also point out an independent numerical gap: the procedure TotalSieve prints the constant 6 where the sieve criterion needs 36. Of the 709 pairs (q, n) with q ≤ 400, 8 ≤ n ≤ 20 covered by Theorem 4.8, 202 cannot be certified by the sieve, 144 of them even with the constant 6. In addition, for n = 8 the 4089777 prime powers q ≡ 5 (mod 6) below 1.45·10^8 are not treated. These pairs are not counterexamples, but they are not proved. Only the arXiv version (v1) was checked; no claim is made about the journal version. This record contains the note (PDF and LaTeX source), the Python verification program, its output (results.json) and the figure. Source repository: https://github.com/Ruqing1963/aguirre-neumann-2022-pairs-audit

Authors

Publication Details

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

A note on the existence of pairs of r-primitive and k-normal elements over finite fields

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

A note on the existence of pairs of r-primitive and k-normal elements over finite fields

Ruqing Chen
preprint en

Abstract

We revisit J. J. R. Aguirre and V. G. L. Neumann, "Pairs of r-primitive and k-normal elements in finite fields" (arXiv:2210.11504; Bull. Braz. Math. Soc. 2023). Its Theorem 3.2 gives an inequality which, for every rational function F in a class Υ_{q^n}(m1, m2), is said to guarantee an r1-primitive k1-normal element α with F(α) r2-primitive k2-normal. The class contains F = x + 1. For q = 2, n = 19, r_i = 1, k_i = 0 the inequality holds (2^9.5 ≈ 724 ≥ 128), but Tr(α + 1) = Tr(α) + 1, so α and α + 1 are never both normal. The same happens for F = x^2 + x. The proof leaves out the character-sum terms with η2 trivial and ψ2 nontrivial. For affine F these terms have size q^n, not O(q^{n/2}). The summary Theorem 4.8 fails in the same way: if p | n or gcd(n, q − 1) = 1, no affine F = ax + b maps a 2-normal element to a 1-normal one. At (q, n) = (5, 10) an exhaustive search over F_{5^10} finds that the 16 affine members of Υ_5(2, 1) give no pair, while each of the other 560 gives at least 3800. We state corrected theorems, adding a nondegeneracy condition (ND) that excludes Artin–Schreier forms h^p − h + c. We also point out an independent numerical gap: the procedure TotalSieve prints the constant 6 where the sieve criterion needs 36. Of the 709 pairs (q, n) with q ≤ 400, 8 ≤ n ≤ 20 covered by Theorem 4.8, 202 cannot be certified by the sieve, 144 of them even with the constant 6. In addition, for n = 8 the 4089777 prime powers q ≡ 5 (mod 6) below 1.45·10^8 are not treated. These pairs are not counterexamples, but they are not proved. Only the arXiv version (v1) was checked; no claim is made about the journal version. This record contains the note (PDF and LaTeX source), the Python verification program, its output (results.json) and the figure. Source repository: https://github.com/Ruqing1963/aguirre-neumann-2022-pairs-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