2000 character limit reached
Primitive prime divisors in the critical orbits of one-parameter families of rational polynomials
Published 4 Mar 2019 in math.DS | (1903.01052v2)
Abstract: For a rational polynomial $f$ and rational numbers $c, u$, we put $f_c(x):=f(x)+c$, and consider the Zsigmondy set $\mathcal{Z}(f_c,u)$ associated to the sequence ${f_cn(u)-u}_{n\geq 0}$, where $f_cn$ is the $n$-st iteration of $f_c$. In this paper, we prove that if $u$ is a rational critical point of $f$, then there exists an $\mathbf M_f>0$ such that $\mathbf M_f\geq \max_{c\in \mathbb{Q}}{#\mathcal{Z}(f_c,u)}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.