Pillai's equation in polynomials (Q2657261)

Let \(a,b\) and \(c\) be fixed non-zero integers. Then the equation \[ a^x - b^y = c \] in positive integers \(x, y \in \mathbb{N}\) is called Pillai's Diophantine equation and it receives much attention, there are many papers in the literature about this problem. In the paper under review, the author considers that equation in polynomials. More precisely, suppose that \(A, B\) and \(C\) are some nonconstant polynomials of \(K[t]\), then it is shown that the equation \[ A(t)^x + B(t)^y = C(t) \] has at most one solution in positive integers \(x, y\) except three special cases described in the paper. In those exceptional cases, the equation has exactly two solutions \((x, y) \in \mathbb{N}^2\). Proof of the main result is based on a series of lemmas obtained from some calculations through the algebraic number theory tools.