Consecutive tuples of multiplicatively dependent integers (Q2116756)

In this paper the authors study the \(n\)-tuples of multiplicatively dependent integers \((a_1,a_2,\dots,a_n)\), where \(1<a_1<\dots<a_n\), for which their shifts \((a_1+j,a_2+j,\dots,a_n+j)\) are also multiplicatively dependent for \(j=1,\dots,k\). In case \(n=2\) and \(k=1\) it is shown that \((2,8)\) and \((3,9)\) is the only pair of consecutive multiplicatively dependent pairs. The authors also construct some infinite series of integer triplets \((a,b,c)\), where \(1<a<b<c\), for which their shifts \((a+1,b+1,c+1)\) are also multiplicatively dependent. Their main result is the following. Let \(a \ne 1,2,8\) be a fixed integer. Suppose that \(b, c \notin \{1,a\}\) are distinct integers larger than \(1\) such that \((a, b, c)\), \((a + 1, b + 1, c + 1)\) and \((a + 2, b + 2, c + 2)\) are each multiplicatively dependent. Then, there is an effectively computable constant \(C=C(a)\) such that \(\max\{a, b, c\} < C\). One of the main ingredients in the proof is a lower bound for the linear form in logarithms.