p-adic root separation and the discriminant of integer polynomials

In this paper we investigate the following related problems: (A) the separation of $p$-adic roots of integer polynomials of fixed degree and bounded height; and (B) counting integer polynomials of a fixed degree and bounded height with discriminant divisible by a (large) power of a fixed prime. One of the consequences of our findings is the existence, for all large $Q>1$, of $Q^{2/n}$ integer irreducible polynomials $P$ of degree $n$ and height $\asymp Q$ with an almost prime power discriminant of maximal size, that is $|D(P)|\asymp Q^{2n-2}$ and $D(P)=p^kC_P$ with $C_P\in\mathbb{Z}$ satisfying $|C_P|\ll1$. Our method generalises techniques developed for the real case and relies on a quantitative non-divergence estimate developed by Kleinbock and Tomanov.