Polynomial parametrization for the solutions of Diophantine equations and arithmetic groups (Q974060)

The central result of this paper is that \(\text{SL}_2(\mathbb Z)\) is a polynomial family, more precisely, there exist polynomials \(A\), \(B\), \(C\), \(D\) in 26 variables and with coefficients from \(\mathbb Z\) such that all integer solutions of \[ ad - bc = 1 \] are precisely all quadruples \((A,B,C,D)\) where the variables run through the integers. This solves a problem posed by F. Beukers and going back to T. Skolem. A series of corollaries and examples employ this theorem to deduce that also other subsets of \(\mathbb Z^n\) are polynomial families, e.g., the set of all primitive solutions of any system of linear equations over \(\mathbb Z\), the set of solutions of several quadratic Diophantine equations, every principal congruence subgroup of \(\text{SL}_2 (\mathbb Z)\), the group of regular elements of \(M_{n \times n} (\mathbb Z)\) and some of its subsets, as \(\text{SL}_n (\mathbb Z)\), \(\text{Spin}_n (\mathbb Z)\), \dots. To prove the main result, the author shows in an ingenious way that every \(\alpha \in \text{SL}_2 (\mathbb Z)\) can be represented as a product of 9 matrices belonging to several subsets of \(\text{SL}_2 (\mathbb Z)\), each of which is a polynomial family (see Prop. 1.5 on p. 993).