Greatest common divisors of iterates of polynomials

Liang Chung Hsia, Thomas J. Tucker

Research output: Contribution to journalArticlepeer-review

4 Citations (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)).

Original languageEnglish
Pages (from-to)1437-1459
Number of pages23
JournalAlgebra and Number Theory
Issue number6
Publication statusPublished - 2017


  • Composition
  • Equidstribution
  • Gcd
  • Heights

ASJC Scopus subject areas

  • Algebra and Number Theory


Dive into the research topics of 'Greatest common divisors of iterates of polynomials'. Together they form a unique fingerprint.

Cite this