Normal and primitive normal elements with prescribed traces in intermediate extensions: counterexamples, corrected main term, and improved thresholds

We audit the paper of A. C. Mazumder, G. Kapetanakis and D. K. Basnet, "Normal and primitive normal elements with prescribed traces in intermediate extensions of finite fields", Finite Fields and Their Applications 110 (2026) 102745 (doi:10.1016/j.ffa.2025.102745; arXiv:2510.14840), which studies normal and primitive normal elements of F_{q^m} with prescribed traces over several intermediate fields F_{q^{d_1}}, ..., F_{q^{d_k}}. Findings:(1) The enumeration of normal elements with prescribed traces (Theorem 3.6) is correct, and holds without the paper's standing hypotheses; we confirm it exhaustively in 36 cases.(2) The main term of the character sum in Section 4 is evaluated without a factor q^D, D = d_1 + ... + d_k. The sufficient condition of Theorem 4.1 is therefore printed with exponent m/2 - lambda - D, where m/2 - lambda is correct.(3) Theorem 5.1 omits the hypothesis that the prescribed traces be normal. As printed it is false for exactly q^lambda - Phi(g) > 0 admissible trace tuples, for every choice of parameters.(4) Two threshold proofs in Theorem 5.1 rest on inequalities that fail for large m (k = 4 and k = 3).(5) Theorem 4.2 (the case lcm(d_i) < m) is not proved by the indicated argument; we prove it when m/lcm(d_i) is a power of the characteristic and whenever the corrected condition applies.(6) The reduction of non-coprime degrees to coprime ones by a change of base field (Remark (1) of Section 5) is invalid. We prove the corrected sufficient condition q^{m/2 - lambda} >= W(q^m - 1) W(x^m - 1) and derive new thresholds: for pairwise coprime degrees, a primitive normal element with any normal admissible traces exists for all q >= 4 when 4 <= k <= 7 (printed: q >= 1334, 9, 7, 5) and for all q >= 8003 when k = 3 (printed: q >= 2.27 * 10^24072855 and m >= 60). No counterexample to an existence statement was found once the prescribed traces are assumed normal. This record contains the paper (LaTeX source and PDF), the figure, the verification programs (exhaustive enumeration in F_{q^m} for q^m <= 2^24, threshold computations, and an explicit example in F_{5^12}), and their output data and logs. Source repository: https://github.com/Ruqing1963/kapetanakis-intermediate-traces-audit

Authors

Publication Details

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

Normal and primitive normal elements with prescribed traces in intermediate extensions: counterexamples, corrected main term, and improved thresholds

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

Normal and primitive normal elements with prescribed traces in intermediate extensions: counterexamples, corrected main term, and improved thresholds

Ruqing Chen
preprint en

Abstract

We audit the paper of A. C. Mazumder, G. Kapetanakis and D. K. Basnet, "Normal and primitive normal elements with prescribed traces in intermediate extensions of finite fields", Finite Fields and Their Applications 110 (2026) 102745 (doi:10.1016/j.ffa.2025.102745; arXiv:2510.14840), which studies normal and primitive normal elements of F_{q^m} with prescribed traces over several intermediate fields F_{q^{d_1}}, ..., F_{q^{d_k}}. Findings:(1) The enumeration of normal elements with prescribed traces (Theorem 3.6) is correct, and holds without the paper's standing hypotheses; we confirm it exhaustively in 36 cases.(2) The main term of the character sum in Section 4 is evaluated without a factor q^D, D = d_1 + ... + d_k. The sufficient condition of Theorem 4.1 is therefore printed with exponent m/2 - lambda - D, where m/2 - lambda is correct.(3) Theorem 5.1 omits the hypothesis that the prescribed traces be normal. As printed it is false for exactly q^lambda - Phi(g) > 0 admissible trace tuples, for every choice of parameters.(4) Two threshold proofs in Theorem 5.1 rest on inequalities that fail for large m (k = 4 and k = 3).(5) Theorem 4.2 (the case lcm(d_i) < m) is not proved by the indicated argument; we prove it when m/lcm(d_i) is a power of the characteristic and whenever the corrected condition applies.(6) The reduction of non-coprime degrees to coprime ones by a change of base field (Remark (1) of Section 5) is invalid. We prove the corrected sufficient condition q^{m/2 - lambda} >= W(q^m - 1) W(x^m - 1) and derive new thresholds: for pairwise coprime degrees, a primitive normal element with any normal admissible traces exists for all q >= 4 when 4 <= k <= 7 (printed: q >= 1334, 9, 7, 5) and for all q >= 8003 when k = 3 (printed: q >= 2.27 * 10^24072855 and m >= 60). No counterexample to an existence statement was found once the prescribed traces are assumed normal. This record contains the paper (LaTeX source and PDF), the figure, the verification programs (exhaustive enumeration in F_{q^m} for q^m <= 2^24, threshold computations, and an explicit example in F_{5^12}), and their output data and logs. Source repository: https://github.com/Ruqing1963/kapetanakis-intermediate-traces-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