Effective bounds for the number of solutions of certain Diophantine equations (Q2544236): Difference between revisions

Let \(b=3,4\) or \(6\), \(\rho=\exp(2\pi ib^{-1})\), \(K=\mathbb Q(\rho)\), \(m\geq 4\), \(a_1,\ldots, a_n\) are distinct nonzero integers of \(K\), \(a_0=\max | a_k|\), \(a\in \mathbb N\), \((a,b)=1\), \(a<b\), \(\nu=ab^{-1}\), \(\delta=(1+b^{(n-2)^{-1}}\). There is an effectively computable constant \(F=F(a_1,\ldots, a_n,\nu)\), such that if \(\gamma\) and \(q\) are integer numbers of \(K\), for which \[ | q |^\delta >(1+a_0|\gamma q^{-1}|)^{(m-1)^2+\delta(m-2)} F |\gamma|^{m(m-1+\delta)}, \] then the Diophantine equation \[ \prod_{t_2=0}^{b-1}\cdots\prod_{t_n=0}^{b-1} (z_1\omega_1+z_2\omega_2\rho^{t_2}+\ldots+z_n\omega_n\rho^{t_n}=f(z_1,\ldots,z_n) \] has only a finite number of integral solutions in \(K\). \((\omega_s=(q+\gamma a_s)^\nu\), \(s=1,\ldots,m\), \(f(z_1,\ldots,z_n)\) is a polynomial with integer coefficients in \(K\), whose degree \(n_f\leq b^{n-1}-3b^{n-2}+(m-1)(b-2)+1)\), \(z_1,\ldots,z_n\) are integers of \(K\) satisfying \(\max_{1\leq k\leq m} | z_k|\leq C\), where \(C=C(\omega_1,\ldots,\omega_n,f)\) is effectively computable.) If \(m=3\), then \(n_f\leq b^2-2b-2\), and if \(m=2\), then \(n_f\leq b-2\).