Stability conjecture for irreducible polynomials of the form
Stability conjecture for irreducible polynomials of the form
Let be an integer, let , and set . The polynomial is irreducible over when it is irreducible as a polynomial in , and it is stable over when every iterate is irreducible over .
Stability conjecture. If is irreducible over , then is stable over .
The paper proves stability in several families of degrees and notes that the claim is implied by the explicit -conjecture. The general assertion remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Shanta Laishram, Ritumoni Sarma and Himanshu Sharma, “Stability of Certain Higher Degree Polynomials”, arXiv:2206.04290 (2022).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.