A note on the explicit theorem of Ha on irreducible polynomials with prescribed coefficients

J. Ha (Finite Fields Appl. 40 (2016), 10–25) proved that there are irreducible polynomials of degree n over F_q with r prescribed coefficients in arbitrary positions when r ≤ (1/4 − ε)n and q is large, and gave three explicit ranges of (q, n, r). This note recomputes the explicit constants of that paper. 1. With the formulas as printed, the sufficient condition fails at the boundary of two of the three ranges: at (q, ρ, B) = (16, 1/4, 1) and (5, 1/5, 2) its right-hand side is 1.3004 and 1.0121, not 0.994 and 0.884. 2. Three steps of the argument need repair: inequality (13), the replacement of ⌈n/(r+1)⌉ by 1/ρ, and the treatment of denominators divisible by T. 3. A corrected criterion recovers the first two explicit assertions (the second already for n ≥ 66 instead of n ≥ 97) and the third for q ≥ 3; for q = 2 it leaves open only n = 52, 53, 60. The asymptotic results of Ha's paper are not affected. The statements of the note are conditional on Lemmas 2.3 and 2.8 of that paper in the form in which they are printed. The record contains the note (PDF and LaTeX source, 6 pages, 4 figures), a pure-Python script that recomputes all tables and numerical statements in a few seconds, its output, and the script that produces the figures. The note, figures and data are licensed under CC BY 4.0. Code is released under the MIT License. Source repository: https://github.com/Ruqing1963/ha-explicit-constants-note

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24269018
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 explicit theorem of Ha on irreducible polynomials with prescribed coefficients

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

A note on the explicit theorem of Ha on irreducible polynomials with prescribed coefficients

Ruqing Chen
preprint en

Abstract

J. Ha (Finite Fields Appl. 40 (2016), 10–25) proved that there are irreducible polynomials of degree n over F_q with r prescribed coefficients in arbitrary positions when r ≤ (1/4 − ε)n and q is large, and gave three explicit ranges of (q, n, r). This note recomputes the explicit constants of that paper. 1. With the formulas as printed, the sufficient condition fails at the boundary of two of the three ranges: at (q, ρ, B) = (16, 1/4, 1) and (5, 1/5, 2) its right-hand side is 1.3004 and 1.0121, not 0.994 and 0.884. 2. Three steps of the argument need repair: inequality (13), the replacement of ⌈n/(r+1)⌉ by 1/ρ, and the treatment of denominators divisible by T. 3. A corrected criterion recovers the first two explicit assertions (the second already for n ≥ 66 instead of n ≥ 97) and the third for q ≥ 3; for q = 2 it leaves open only n = 52, 53, 60. The asymptotic results of Ha's paper are not affected. The statements of the note are conditional on Lemmas 2.3 and 2.8 of that paper in the form in which they are printed. The record contains the note (PDF and LaTeX source, 6 pages, 4 figures), a pure-Python script that recomputes all tables and numerical statements in a few seconds, its output, and the script that produces the figures. The note, figures and data are licensed under CC BY 4.0. Code is released under the MIT License. Source repository: https://github.com/Ruqing1963/ha-explicit-constants-note

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