Pith. sign in

REVIEW 2 major objections 3 minor 21 references

Factorization of Dickson polynomials over Finite Fields

T0 review · 2 major / 3 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper proves that, whenever every prime divisor of $n$ also divides $q-1$, every irreducible factor of the Dickson polynomial $D_n(x;a)$ over $\mathbb{F}_q$ is one of an explicitly listed set of Dickson shifts, with analogous…

desk verdict The main theorem is false as stated for q ≡ 3 mod 4 with n odd, but the underlying reduction is sound and the paper can likely be repaired. read the letter →

arxiv 1908.05508 v1 pith:UN7LM36C submitted 2019-08-15 math.NT

F. E. Brochero Martínez , Nelcy Esperanza Arévalo Baquero This is my paper · ORCID
classification math.NT MSC 12E2011T30
keywords irreduciblepolynomialfactorsfactorizationDicksonpolynomialsfinitefieldscharacteristic2second-kindrad(n)dividesq-1
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims a complete, explicit factorization of the Dickson polynomials $D_n(x;a)$ and $E_n(x;a)$ over a finite field $\mathbb{F}_q$, under the hypothesis that every prime divisor of $n$ (for the first kind) or of $n+1$ (for the second kind) also divides $q-1$. The result says every irreducible factor has the shape $D_t(x,a)-b^t(\alpha+\alpha^{-1})$, with three arithmetic conditions on $t$ and $\alpha$ that decide exactly when such a polynomial is irreducible. The proof works by converting a Dickson polynomial into the binomial $x^{2n}+a^n$, factoring that binomial, and mapping the factors back through an inverse construction. If the claim is right, factorizations previously known only for special $n$ become available for every $n$ whose prime factors lie in $q-1$, with no undetermined coefficients.

What carries the argument

The load-bearing object is the reciprocal correspondence $\Phi_a(f)(x)=x^m f(x+a/x)$, whose inverse $\Psi_a$ rewrites a self-reciprocal polynomial as a linear combination of Dickson polynomials. The decisive identity is $\Phi_a(D_n(x,a))=x^{2n}+a^n$ (Corollary 2.8), which reduces the factorization of $D_n$ to the factorization of the binomial $x^{2n}+a^n$. From a quoted theorem on $x^m-1$, every irreducible factor of $x^{2n}+a^n$ is $x^t-\alpha$ up to sign, and the pair $(x^t-\alpha)(x^t-\alpha^{-1})$ maps under $\Psi_a$ to $D_t(x,a)-b^t(\alpha+\alpha^{-1})$; the three conditions on $t$ and $\alpha$ are exactly the usual binomial-irreducibility conditions in this setting. The same bridge, applied to $x^{2(n+1)}-a^{n+1}$ over $x^2-a$, gives the second-kind results.

What would settle it

Run the stated recipe on a small concrete case, such as $q=7$, $n=3$, $a=2$ (a square in $\mathbb{F}_7$): factor $D_3(x,2)=x^3+x$ over $\mathbb{F}_7$, and check that the quadratic factor $x^2+1$ appears in the list as $D_2(x,2)-2(\alpha+\alpha^{-1})$ for some $\alpha$ with $\alpha^3=-1$. The claim is false if any irreducible factor is missing from the list or if any listed polynomial factors further; the same check for $E_n$ with small $q$ tests the unproved second-kind theorem.

Watch

Extended reading notes

Core claim

The central discovery is Theorem 3.1: if $a$ is a square in $\mathbb{F}_q^*$, and either $q\equiv 1\pmod{4}$ or $n$ is odd, and $\operatorname{rad}(n)\mid q-1$, then every irreducible factor of $D_n(x;a)$ over $\mathbb{F}_q$ is $D_t(x,a)-b^t(\alpha+\alpha^{-1})$, where $b^2=a$, $\alpha\in\mathbb{F}_q^*$, $t\mid 4n/\gcd(4n,q-1)$, and (i) $\alpha^{2n/t}=-1$, (ii) $\operatorname{rad}(t)\mid \operatorname{ord}_q(\alpha)$, (iii) $\gcd(t,(q-1)/\operatorname{ord}_q(\alpha))=1$. The paper extends the same description: for $q\equiv 3\pmod{4}$ and even $n$, or for nonsquare $a$, $\alpha$ may live in $\mathbb{F}_{q^2}$, and when a factor is not rational, two conjugate factors must be multiplied together; for the second-kind $E_n$, the condition $\alpha^{2(n+1)/t}=1$ replaces $-1$; and in characteristic 2 the factors occur with multiplicity two after removing $x$. The authors state the second-kind theorems without proof, as consequences of the same argument.

Load-bearing premise

The entire list rests on the quoted factorization theorems for $x^n-1$ from an earlier paper, and on the assertion that the second-kind theorems follow from the first-kind proof without being written out; if either assumption hides an exception, the factor list would be incomplete or would contain reducible polynomials.

Editorial extensions

If this is right

  • A complete factorization algorithm: enumerate divisors $t$ of $4n/\gcd(4n,q-1)$, find $\alpha$ with $\alpha^{2n/t}=-1$ in $\mathbb{F}_q$, keep those satisfying the two order conditions, and output $D_t(x,a)-b^t(\alpha+\alpha^{-1})$; no irreducibility testing is needed.
  • For square $a$, a linear change of variable reduces $D_n(x,a)$ to $D_n(x)$, so the same list covers all square parameters; nonsquare parameters are handled by products of conjugate factors.
  • Earlier explicit factorizations for orders such as $3\cdot 2^m$ become special cases, because $\operatorname{rad}(n)\mid q-1$ holds automatically when $n$ is a power of two.
  • For the second kind, the hypothesis $\operatorname{rad}(n+1)\mid q-1$ yields the same factor shape with the exponent condition $\alpha^{2(n+1)/t}=1$, with the exceptional pairs $(\alpha,t)=(1,\pm1)$ excluded.
  • In characteristic 2, the factorization of $D_n(x,a)$ reduces to factoring $x^n+1$; the paper's list gives the squarefree part directly, with each nontrivial factor appearing with multiplicity 2.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same $\Phi_a/\Psi_a$ bridge would give explicit factorizations for any $n$ for which $x^{4n}-1$ has a known binomial-type factorization, so a natural next step is to drop or weaken $\operatorname{rad}(n)\mid q-1$ to hypotheses on the 2-adic part of $q-1$.
  • Because the only unproved part is the analogy for second-kind polynomials, a computational check of Theorems 4.2–4.4 on small fields would settle completeness quickly; a missing exceptional factor would most likely appear there rather than in the first-kind lists.
  • In applications where a minimal polynomial divides $D_n(x,q)+(-1)^{n-1}$, such as Kloosterman sums, the explicit Dickson factors would identify the possible minimal polynomials directly whenever the hypotheses hold.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 3 minor

Summary. The paper studies the explicit irreducible factorization of Dickson polynomials of the first and second kind over finite fields. Using the map Phi_a that sends a Dickson polynomial D_n(x,a) to x^{2n}+a^n (and the analogous identity for E_n), the authors reduce the problem to factoring binomials of the form x^{2n} +/- 1 or (x^{2(n+1)} - a^{n+1})/(x^2-a). They then state theorems, under the condition rad(n)|q-1 (respectively rad(n+1)|q-1), that list all irreducible factors as D_t(x,a) - b^t(alpha + alpha^{-1}) with explicit conditions on t and alpha, splitting the cases according to q mod 4, whether a is a square, and parity of n. The first-kind theorems are proved in Section 3, the second-kind theorems 4.2-4.4 are asserted without proof, and Section 5 handles characteristic 2. The paper claims to generalize earlier results of Chou, Fitzgerald-Yucas, and Tosun.

Significance. The problem is natural and the reduction through the self-reciprocal map Phi_a is a promising and explicit strategy: it converts the factorization of Dickson polynomials into the better-understood factorization of binomials, and the listed factors are concrete. If the results were correct, they would unify and extend several earlier special-case classifications and would cover both kinds of Dickson polynomials as well as characteristic 2. The paper also makes its dependence on the published factorization theorems 2.10-2.11 from [5] explicit. However, the central first-kind theorem is false in one parity/congruence case, and the second-kind theorems are central claims that are stated without proof; in their present form the results cannot be regarded as established.

major comments (2)
  1. [Theorem 3.1] Theorem 3.1 is false as stated for q ≡ 3 (mod 4) and n odd. Take q=7, n=3, a=1: then D_3(x,1)=x^3-3x=x(x^2+4) over F_7, and x^2+4 is irreducible because its discriminant is 5, a non-square modulo 7. The theorem asserts that every irreducible factor is of the form D_t(x,a)-b^t(alpha+alpha^{-1}) with t dividing 4n/gcd(4n,q-1)=12/6=2, so t=1 or t=2. The factor x cannot be represented with t=1 because condition (i) requires alpha^6=-1 in F_7^*, and every sixth power in F_7^* is 1; t=2 gives degree 2 and cannot equal x. The proof breaks in case (b): for t a power of 2 it relies on q ≡ 1 (mod 4) to conclude that y^t+1 is reducible, but in the q ≡ 3 (mod 4), n odd branch t=2 is allowed and y^2+1 is irreducible over F_7. This is an actual omission of an irreducible factor, not a boundary artifact; the theorem needs an explicit exceptional factor (or a different case split) and a corrected proof.
  2. [Theorems 4.2-4.4] The second-kind theorems are central claims of the paper, but they are asserted 'without proof' by analogy with the first-kind proof. Since the analogous first-kind proof in Theorem 3.1 contains the substantive gap described above, this is not sufficient for a refereed publication; the authors should supply complete proofs or clearly mark these statements as conjectural. The statements also contain defects that need correction: Theorem 4.2(iv) excludes (alpha,t)=(1,-1), which is impossible because t is a positive divisor, and the intended exclusion is presumably (alpha,t)=(-1,1); and Theorem 4.4 says t divides 2(n+1), whereas Theorem 4.2 and the first-kind analogue require t to divide 2(n+1)/gcd(2(n+1),q-1). These issues must be resolved before the second-kind classification can be accepted.
minor comments (3)
  1. [General] The manuscript contains many typographical errors and awkward phrases, for example 'irreducibl e factors', 'an square', 'find', and 'some that every prime divisor'; a careful proofreading pass is needed.
  2. [References] References [13] and [15] appear to be the same book by Lidl, Mullen, and Turnwald; one duplicate should be removed.
  3. [Section 5] In Theorem 5.2 the phrase 'different than x' should be 'different from x'; also, condition (iv) excludes only (alpha,t)=(1,1), which is the only self-conjugate case in characteristic 2 since -1=1, so the notation should be made consistent with the rest of the paper.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Dickson factorization is derived by a non-circular reduction to the independent binomial factorization of x^n - 1, with no fitted parameters and no input equivalent to the target.

full rationale

The paper's derivation chain is non-circular. Corollary 2.8 gives Phi_a(D_n(x,a)) = x^{2n} + a^n, so irreducible factors of D_n correspond to factors of x^{2n} + a^n through the bijective maps Phi_a and Psi_a from Theorem 2.7. The proof then invokes Theorems 2.10 and 2.11, quoted from the authors' earlier paper [5], to classify irreducible factors of x^{4n} - 1 and hence of x^{2n} + 1. This is a self-citation in the sense that one of the present authors co-authored [5], but the cited result is a parameter-free theorem about binomials x^n - 1, with stated assumptions (rad(n) | q - 1, and q ≡ 1 mod 4 or 8 ∤ n) that do not include Dickson polynomials. It is not fitted to the Dickson factorization and does not presuppose the theorem being proved. No constant is fitted and no 'prediction' is used to set an input. The reviewer's skeptical example about q ≡ 3 mod 4 and n odd, and the unproved second-kind theorems 4.2-4.4 ('enunciated without proof'), are correctness risks rather than circularity: they do not make the conclusion equivalent to an input. No specific circular reduction can be quoted from the paper, so the appropriate finding is no significant circularity.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No free parameters are fitted to data. The paper's contribution is a derivation from standard Dickson identities plus a borrowed factorization of x^n - 1. The only notable ledger entry is the prior theorem from [5], which is self-cited but externally published.

assumptions (5)
  • standard math Waring identities defining D_n and E_n, expressing D_n(y + a/y, a) = y^n + (a/y)^n.
    Taken as the starting point in Definitions 2.1 and 2.2; these are standard identities and are not proved in the paper.
  • domain assumption Lemma 2.3 properties of Dickson polynomials, including scaling and Frobenius power identities, from Lidl-Mullen-Turnwald.
    Used to reduce D_n(x,a) to D_n(x,1) and to handle powers of the characteristic; accepted from the literature.
  • domain assumption Theorem 2.7: the maps Phi_a and Psi_a give a multiplicative bijection between polynomials and a-self-reciprocal polynomials, preserving irreducibility, from Fitzgerald-Yucas.
    This is the bridge from binomial factors to Dickson factors; the paper quotes it without proof.
  • standard math Theorem 2.9, the irreducibility criterion for f(x^n), from Lidl-Niederreiter.
    Used to justify irreducibility of the binomial factors; this is a standard finite-field criterion.
  • domain assumption Theorems 2.10 and 2.11, explicit factorization of x^n - 1 into binomials or quadratics, from Brochero-Martinez-Giraldo-de Oliveira [5].
    This is the load-bearing black box for every subsequent factorization; it is not reproved here. One of the present authors is a coauthor of [5], so this is a self-citation, but it is an independently published prior result.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Factorization of Dickson polynomials over Finite Fields." pith.science (2026). https://pith.science/paper/UN7LM36C

@misc{pith2026190805508,
  author       = {Pith},
  title        = {Pith review of: Factorization of Dickson polynomials over Finite Fields},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/UN7LM36C}},
  note         = {Machine review of arXiv:1908.05508}
}
abstract

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these polynomials in the case that every prime divisor of $n$ divides $q-1$. This result generalizes the results find in Chou, W.S., The Factorization of Dickson polynomials over finite fields. Finite Fields Appl. {\bf3} (1997) 84-96, Fitzgerald R. W., Yucas J. L., Explicit factorization of cyclotomic and Dickson polynomials over finite fields. Arithmetic of Finite Fields. Lecture Notes in Computer Science, vol. {\bf 4547}, pp. 1-10. Springer, Berlin (2007), Tosun, S., Explicit factorizations of generalized Dickson polynomials of order $2^{m}$ via generalized cyclotomic polynomials over finite fields. Finite Fields Appl. {\bf 38} (2016) 40-56 and Tosun, S., Explicit factors of generalized cyclotomic polynomials and generalized Dickson polynomials of order $2^m3$ over finite fields. Discrete Math. 342 (2019) DOI: j.disc.2019.111618

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

21 extracted references · 19 canonical work pages

  1. [5]

    E., Giraldo Vergara, C

    Brochero Mart ´ ınez, F. E., Giraldo Vergara, C. R., de Oli veira, L., Explicit factorization of xn − 1 ∈ Fq[x]. Des. Codes Cryptogr. 77 , no. 1, 277-286 (2015)

    work page 2015

  2. [1]

    Finite Fields Appl

    Alaca, S., Congruences for Brewer sums . Finite Fields Appl. 13 (2007) 1-19

    work page 2007

  3. [2]

    and Zieve, M., Factoring Dickson polynomials over finite fields

    Bhargava, M. and Zieve, M., Factoring Dickson polynomials over finite fields . Finite Fields Appl. 5 (1999) 103-111

    work page 1999

  4. [3]

    F., Gao, S., Mullin, R

    Blake, I. F., Gao, S., Mullin, R. C., Explicit factorization of x2k + 1 over Fp with p ≡ 3 (mod 4), Appl. Algebra Engrg. Comm. Comput. 4 89-94 (1993)

    work page 1993

  5. [4]

    Brewer,B.W., On certain character sums , Trans. Amer. Math. Soc. 99 (1961) 241-245

    work page 1961

  6. [6]

    E., Reis, Lucas, Silva-Jesus, La ys, Factorization of composed polynomials and applications , Discrete Math

    Brochero Mart ´ ınez, F. E., Reis, Lucas, Silva-Jesus, La ys, Factorization of composed polynomials and applications , Discrete Math. 342 (2019) DOI: j.disc.2019.111603

    arXiv 2019

  7. [7]

    Finite fields and Their Applications 24 95-104 (2013)

    Chen, B., Li, L., Tuerhong, R., Explicit factorization of x2m pn − 1 over a finite field . Finite fields and Their Applications 24 95-104 (2013)

    work page 2013

  8. [8]

    Finite Fields Appl

    Chou, W.S., The Factorization of Dickson polynomials over finite fields . Finite Fields Appl. 3 (1997) 84-96

    work page 1997

Show all 21 references
  1. [9]

    W., Yucas, J

    Fitzgerald, R. W., Yucas, J. L. Factors of Dickson polynomials over finite fields. F inite Fields Appl. 11 (2005), 724-737

    2005

  2. [10]

    W., Yucas J

    Fitzgerald R. W., Yucas J. L., Explicit factorization of cyclotomic and Dickson polynomi als over finite fields . Arithmetic of Finite Fields. Lecture Notes in Computer Science, vol. 4547, pp. 1-10. Springer, Berlin (2007)

    2007

  3. [11]

    Fitzgerald, R. W. and Yucas, J. L., Generalized Reciprocals, Factors of Dickson polynomials a nd Generalized Cyclo- tomic Polynomials over Finite Fields . Finite Fields Appl. 13 (2007) 492-515

    2007

  4. [12]

    Gao, S., Mullen, G., Dickson polynomials and irreducible polynomials over finit e fields. J. Number Theory 49 (1994), 118-132

    1994

  5. [14]

    Encyclopedia of Mathematics and Its Applications, Vol 20, Addison-W esley 1983

    Lidl, R., Niederreiter, H., Finite Fields . Encyclopedia of Mathematics and Its Applications, Vol 20, Addison-W esley 1983

    1983

  6. [15]

    and Turnwald, G., Dickson polynomials

    Lidl, R., Mullen, G.L. and Turnwald, G., Dickson polynomials. Pitman Monographs and Surveys in Pure and Applied Math. Essex (1993)

    1993

  7. [16]

    Finite Fields Appl

    Meyn H., Factorization of the cyclotomic polynomials x2n + 1 over finite fields . Finite Fields Appl. 2, 439-442 (1996)

    1996

  8. [17]

    On certain values of Kloosterman sums

    Moisio, M.J. On certain values of Kloosterman sums. IEEE Trans. Inform. Theory 55 (2009), 3563-3564. 8 N. E. AR ´EV ALO BAQUERO AND F. E. BROCHERO MART ´INEZ

    2009

  9. [18]

    Finite Fields Appl

    Tosun, S., Explicit factorizations of generalized Dickson polynomia ls of order 2m via generalized cyclotomic polynomials over finite fields . Finite Fields Appl. 38 (2016) 40-56

    2016

  10. [19]

    342 (2019) DOI: j.disc.2019.111618

    Tosun, S., Explicit factors of generalized cyclotomic polynomials an d generalized Dickson polynomials of order 2m3 over finite fields Discrete Math. 342 (2019) DOI: j.disc.2019.111618

    2019

  11. [20]

    Reducibility of translates of Dickson polynomials

    Turnwald, G. Reducibility of translates of Dickson polynomials. Proc. Amer. Math. Soc. 126 (1998), 965-971

    1998

  12. [21]

    Tuxanidy, A., W ang, Q., Composed products and factors of cyclotomic polynomials ov er finite fields . Des. Codes Cryptogr. 69 (2013), 203-231

    2013

  13. [22]

    W ang, L., W ang, Q., On explicit factors of cyclotomic polynomials over finite fie lds. Des. Codes Cryptogr. 63, no. 1, 87-104 (2012). Departamento de Matem ´atica, Universidade Federal de Rio Grande do Sul, UFRGS, Porto Alegre, RS, 91509-900, Brazil, E-mail address : nearevalo...

    2012

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.