Construction of Polynomials with prescribed divisibility conditions on the critical orbit

2022/09/15 by Mohammad Sadek, Sadek, Mohammad, Mohamed Wafik +1
Computer Science · Mathematics · #Advanced Differential Equations and Dynamical Systems #Algebraic Geometry and Number Theory #Coding theory and cryptography #Dynamical Systems (math.DS) #FOS: Mathematics #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.2209.07624

openalex publication_date 2022/09/15 · openalex created_date 2022/09/20 · openalex updated_date 2026/07/28

Abstract

We consider the family of polynomials f_d,c(x)=x^d+c over the rational field \Q. Fixing integers d, n≥ 2, we show that the density of primes that can appear as primitive prime divisors of f_d,cⁿ(0) for some c∈\Q is positive. In fact, under certain assumptions, we explicitly calculate the latter density when d=2. Furthermore, fixing d,n≥ 2, we show that for a given integer N>0, there is c∈ \Q such that \fⁿ(0) has at least N primitive prime divisors each of which is appearing up to any predetermined power. This shows that there is no uniform upper bound on the number of primitive prime divisors in the critical orbit of \f(x) that does not depend on c. The developed results provide a method to construct polynomials of the form \f(x) for which the splitting field of the m-th iteration, m≥1, has Galois group of maximal possible order. During the course of this work, we give explicit new results on post-critically finite polynomials \f(x) over local fields.

Related

• On the orbit of a post-critically finite polynomial of the form x^d + c
• Primitive prime divisors in the critical orbits of one-parameter families of rational polynomials
• Prime divisors in polynomial orbits over function fields
• On rational periodic points of x^d+c
• Eventual Stability of pure polynomials over the rational field