Eventual stability conjecture for reducible cubic polynomials
Eventual stability conjecture for reducible cubic polynomials
Let with . Here denotes the -fold iterate of . Eventual stability conjecture. If is reducible over , then has exactly two irreducible factors over for each and for all . The paper proves this for and conjectures that the result holds for every nonzero integer .
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).
Additional references
3 papers in this index state this conjecture (2006–2022). The statement above is taken from the most recent of them; the others are arXiv:1603.00673, arXiv:math/0612415.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.