Table of Contents
Fetching ...

On multiplicative dependence between elements of polynomial orbits

Marley Young

Abstract

We classify the pairs of polynomials $f,g \in \mathbb{C}[X]$ having orbits satisfying infinitely many multiplicative dependence relations, extending a result of Ghioca, Tucker and Zieve. Moreover, we show that given $f_1,\ldots, f_n$ from a certain class of polynomials with integer coefficients, the vectors of indices $(m_1,\ldots,m_n)$ such that $f_1^{m_1}(0),\ldots,f_n^{m_n}(0)$ are multiplictively dependent are sparse. We also classify the pairs $f,g \in \mathbb{Q}[X]$ such that there are infinitely many $(x,y) \in \mathbb{Z}^2$ satisfying $f(x)^k=g(y)^\ell$ for some (possibly varying) non-zero integers $k,\ell$.

On multiplicative dependence between elements of polynomial orbits

Abstract

We classify the pairs of polynomials having orbits satisfying infinitely many multiplicative dependence relations, extending a result of Ghioca, Tucker and Zieve. Moreover, we show that given from a certain class of polynomials with integer coefficients, the vectors of indices such that are multiplictively dependent are sparse. We also classify the pairs such that there are infinitely many satisfying for some (possibly varying) non-zero integers .
Paper Structure (11 sections, 17 theorems, 52 equations)

This paper contains 11 sections, 17 theorems, 52 equations.

Key Result

Theorem 1.1

GTZ2 Let $f,g \in \mathbb{C}[X]$ be polynomials which are not linear. If there exist $x,y \in \mathbb{C}$ such that the intersection ${\mathcal{O}}_f(x) \cap {\mathcal{O}}_g(y)$ is infinite, then $f$ and $g$ share a common iterate.

Theorems & Definitions (29)

  • Theorem 1.1
  • Conjecture 1.2
  • Theorem 1.3
  • Theorem 1.4
  • Conjecture 1.6
  • Theorem 1.7
  • Theorem 1.8
  • Lemma 2.1
  • Theorem 2.2
  • Lemma 2.3
  • ...and 19 more