Abstract
One of the interesting problems in arithmetic dynamics is to study the stability of polynomials over a field. In this paper, we study the stability of for , . We show that for infinite families of , whenever is irreducible, all its iterates are irreducible, that is, is stable. For , we show that all the iterates of are irreducible. Also we show that for , if is reducible, then the number of irreducible factors of each iterate of is exactly for .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.