Exact upper bounds for the number of the polynomials with given discriminants (Q2411299)

In the paper under review, the authors obtain an upper estimate on the number of cubic integer polynomials of bounded height and discriminant. The rather technical result generalises a classical result of \textit{H. Davenport} [Mathematika 8, 58--62 (1961; Zbl 0104.04001)]. To state the main result, for \(Q \in\mathbb{N}\), let \(\mathcal{P}_3(Q)\) denote the set of cubic polynomials \(P(x)=a_3x^3+a_2 x^2+a_1 x + a_0\), with \(H(P)=\max_{0 \le i \le 3} \{\vert a_i \vert\} \le Q\). Letting \(D(P)\) denote the discriminant of such a polynomial, define for \(v \in [0,2]\) the set \(\mathcal{P}_2(Q,v)\) of polynomials in \(\mathcal{P}_n(Q)\) with \(1 \le \vert D(P) \vert < Q^{4-2v}\). Now, for a polynomial \(P \in\mathcal{P}_n(Q)\), let \(\alpha_1, \alpha_2, \alpha_3\) denote its roots ordered such that for some choice of \(\rho_2\) and \(\rho_3\), we have \[ \vert \alpha_1-\alpha_2 \vert \le \vert \alpha_1-\alpha_3 \vert, \quad \vert \alpha_1-\alpha_2 \vert = Q^{-\rho_2}, \quad \vert \alpha_1-\alpha_3 \vert = Q^{-\rho_3}, \quad 0 \le \rho_3 \le \rho_2. \] Finally, let \(\mathcal{P}'_2(Q,v)\) be the set of polynomials \(P \in\mathcal{P}_3(Q,v)\) for which \[ \frac{v}{3} \le \rho_2 \le 4-\frac{5v}{3}. \] The main result of the paper states that for any \(\varepsilon > 0\) and any sufficiently large \(Q\), \[ \#\mathcal{P}'_3(Q,v) \ll Q^{4-5v/3 + \varepsilon}, \] for \(v \in [0,2]\).