Greatest common divisors of iterates of polynomials

From MaRDI portal
Publication:2399262

DOI10.2140/ANT.2017.11.1437zbMATH Open1392.37103arXiv1611.04115OpenAlexW2552480199MaRDI QIDQ2399262FDOQ2399262


Authors: Liang-Chung Hsia, Thomas Tucker Edit this on Wikidata


Publication date: 22 August 2017

Published in: Algebra \& Number Theory (Search for Journal in Brave)

Abstract: Following work of Bugeaud, Corvaja, and Zannier for integers, Ailon and Rudnick prove that for any multiplicatively independent polynomials, a,binmathbbC[x], there is a polynomial h such that for all n, we have [ gcd(a^n - 1, b^n - 1) mid h] We prove a compositional analog of this theorem, namely that if f,ginmathbbC[x] are nonconstant compositionally independent polynomials and c(x)inmathbbC[x], then there are at most finitely many lambda with the property that there is an n such that (xlambda) divides gcd(fcircn(x)c(x),gcircn(x)c(x)).


Full work available at URL: https://arxiv.org/abs/1611.04115




Recommendations




Cites Work


Cited In (15)





This page was built for publication: Greatest common divisors of iterates of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399262)