The two-factor conjecture for iterated QcQ_c-transforms

Let ff be an irreducible polynomial over Fq\mathbb F_q of degree n3n\ge 3, and let QcQ_c be a polynomial of degree DD. Suppose that nn is odd and D2(mod4)D\equiv 2\pmod 4, and that the QcQ_c-transform fQcf^{Q_c} is irreducible. Two-factor conjecture. Then (fQc)Qc(f^{Q_c})^{Q_c} factors over Fq\mathbb F_q into two irreducible polynomials, each of degree nD22\frac{nD^2}{2}. The claim is motivated by computational tests and concerns the exceptional case in which the general irreducibility result does not apply; it remains open in the supplied source.

Sources & referencesView supporting material

Primary source

Daniel Panario, Lucas Reis and Qiang Wang, “Construction of irreducible polynomials through rational transformations”, arXiv:1905.07798 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.