Greatest common divisors of iterates of polynomials

Liang Chung Hsia, Thomas J. Tucker

研究成果: 雜誌貢獻文章

3 引文 斯高帕斯(Scopus)

摘要

Following work of Bugeaud, Corvaja, and Zannier for integers, Ailon and Rudnick prove that for any multiplicatively independent polynomials, a,bεℂℂ[x], there is a polynomial h such that for all n, we have gcd(an-1,bn-1)|h We prove a compositional analog of this theorem, namely that if f,gεℂℂ[x] are compositionally independent polynomials and c(x)εℂℂ[x], then there are at most finitely many λ with the property that there is an n such that (x-λ) divides gcd(fon(x)-c(x),gon(x)-c(x)).

原文英語
頁(從 - 到)1437-1459
頁數23
期刊Algebra and Number Theory
11
發行號6
DOIs
出版狀態已發佈 - 2017 一月 1

    指紋

ASJC Scopus subject areas

  • Algebra and Number Theory

引用此