How does the discriminant of integer polynomials depend on the distribution of roots?

Let $n\in\mathbb{N}$ be fixed, $Q>1$ be some natural parameter, and $\mathcal{P}_n(Q)$ denote the set of integer polynomials of degree $n$ and height of at most $Q$. Given a polynomial $P(x)=a_nx^n+\cdots+a_0\in\mathbb{Z}[x]$ of degree $n$, the discriminant of $P(x)$ is defined by
$$ D(P)=a_n^{2n-2}\prod_{1\le i<j\le n}(\alpha_i-\alpha_j)^2, $$
where $\alpha_1, \ldots, \alpha_n\in\mathbb{C}$ are the roots of $P(x)$.
In this paper we investigate the following problem on the number of polynomials with small discriminants: for a given $0\le v\le 2$ and sufficiently large $Q$, estimate the value of $\#\mathcal{P}_n(Q,v) $, where $\mathcal{P}_n(Q,v)$ denote the class of polynomials $P\in\mathcal{P}_n(Q)$ such that
$$ 0<|D(P)|\le Q^{2n-2-2v}. $$

The first results for the estimate of the number of polynomials with given discriminants were received by H. Davenport in 1961, which were crucial to the solving of the problem of Mahler.
In this paper for the first time we obtain the exact upper and lower bounds for $\#\mathcal{P} _3(Q,v)$ with the additional condition on the distribution of the roots of the polynomials.
It is interesting that the value of $\#\mathcal{P}_n(Q,v)$ has the largest value when all the roots of polynomials are close to each other. If there are only $k$, $2\le k<n$, close roots to each other then the value of $\#\mathcal{P}_n(Q,v)$ will be less.
Bibliography: 15 titles.