Counting solutions of decomposable form equations

From MaRDI portal





Let \(F(x)\) be a homogeneous polynomial in \(n\) variables \((x_1, \dots, x_n)= {\mathbf x}\) which factorizes into linear factors with algebraic coefficients. This is called a decomposable form with coefficients in \(\mathbb{Z}\). The authors study the number of solutions of the decomposable form equation (*) \(F({\mathbf x}) =a\), \(a\in \mathbb{Z}\), in the integer unknowns \({\mathbf x}\). Put \(|{\mathbf x} |= \max_{1\leq i\leq n} |x_i |\) and for any positive integer \(N\), let \(P(N)\) be the number of solutions of (*) for which \(|{\mathbf x} |< N\). Under certain explicitly stated conditions -- but too technical to be stated in this review -- the authors prove that \[ P(N)= \rho_1 (\log N)^r +O\bigl( (\log N)^{r-1} \bigr)\quad \text{as } N\to \infty, \] where the nonnegative integer \(r\) has also an explicit, technical meaning and the positive constant \(\rho_1\) depends only on \(F\) and \(a\). Under another analogous but more restrictive set of conditions, they also prove that \[ P(N)= \rho_1 (\log N)^r+ \rho_2(\log N)^{r-1}+ o \bigl( (\log N)^{r-1} \bigr) \quad \text{as } N\to \infty, \] with constants \(\rho_1>0\) and \(\rho_2\) depending only on \(F\) and \(a\). The constants \(\rho_1,\rho_2\) are not effective, since the author's proof depends on the Thue-Siegel-Roth-Schmidt method. Another interesting result of this paper concerns units in abelian group rings. Let \(\Gamma\) denote a finite abelian group and \(\mathbb{Z} \Gamma\) the integral group ring. Let \(T_\Gamma\) denote the subgroup of \(\mathbb{Z} \Gamma^*\) defined by \(T_\Gamma =\{\pm\gamma: \gamma\in \Gamma\}\). For any \(x= \sum_\gamma x_\gamma \gamma\in\mathbb{Z}\Gamma\), the norm of \(x\) is defined by \(|x|= \max_\gamma |x_\gamma |\); a counting function is then defined by \(U_\Gamma (N)= \# \{x\in \mathbb{Z} \Gamma^*: |x|<N\}\). The authors prove nice asymptotic formulas for \(U_\Gamma(N)\) as \(N\to\infty\).











This page was built for publication: Counting solutions of decomposable form equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3130237)