Arithmetic progressions of squares, cubes and \(n\)-th powers (Q1048673)

The authors investigate the question of unlike powers in arithmetic progressions. They provide sharp upper bounds for the length of primitive non-constant arithmetic progressions consisting of squares/cubes and \(n\)--th powers. Here is an example of these results: Theorem. Let \(n\) be a prime and \(x_1^{l_1}, \dots, x_t^{l_t}\) be a primitive non-constant arithmetic progression of integers with \(l_i\in \{2,n\}\) for \(i=1\), \dots, \(t\), then \(t\leq 6\). The proofs use deep methods: the modular method and elliptic Chabauty's method,