On a class of combinatorial Diophantine equations (Q1595303)

The authors give a combinatorial proof for a second order recurrence for the polynomials \(p_n(k)\), which count the number of integral lattice points \({\mathbf x}= (x_1,\dots, x_n)\) with \(|x_1|+\cdots+|x_n|\leq k\). This approach is extended to the more general context of permutations with coloured cycles. Furthermore, the results are used to show that certain related Diophantine equations have only finitely many solutions. This complements earlier work of \textit{P. Kirschenhofer, A. Pethő} and \textit{R. F. Tichy} [Acta Sci. Math. 65, 47-59 (1999; Zbl 0983.11013)], see also \textit{Y. Bilu} and \textit{R. F. Tichy} [Acta Arith. 95, 261-288 (2000; Zbl 0958.11049)].