The two-factor conjecture for iterated -transforms
The two-factor conjecture for iterated -transforms
Let be an irreducible polynomial over of degree , and let be a polynomial of degree . Suppose that is odd and , and that the -transform is irreducible. Two-factor conjecture. Then factors over into two irreducible polynomials, each of degree . 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.