On the inverse stability of zn+c.

Abstract

Let K be a field and φ(z)∈ K[z] be a polynomial. Define (z) := 1φ(z) ∈ K(z). For n ∈N* , let the n-th iterate of (z) be defined as (n)(z) = ·s n times(z). We express the \((n)(z)\) in its reduced form as \( (n)(z) = fn,φ(z)gn,φ(z), \) where \(fn,φ(z)\) and \(gn,φ(z)\) are coprime polynomials in \(K[z]\). A polynomial φ(z) ∈ K[z] is called inversely stable over K if every gn,φ(z) in the sequence \gn,φ(z)\n=1∞ is irreducible in K[z]. This paper investigates the inverse stability of the binomials φ(z) = zd + c over K.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…