PUB - Publikationen an der Universität Bielefeld

Let n is an element of N be fixed, Q > 1 be a real parameter and P-n(Q) denote the set of polynomials over Z of degree n and height at most Q. In this paper we investigate the following counting problems regarding polynomials with small discriminant D(P) and pairs of polynomials with small resultant R(P-1, P-2): (i) given 0 <= v <= n 1 and a sufficiently large Q, estimate the number of polynomials P is an element of P-n(Q) such that 0 < vertical bar D(P)vertical bar <= Q(2n-2-2v); (ii) given 0 <= w <= n and a sufficiently large Q, estimate the number of pairs of polynomials P-1, P-2 is an element of P-n(Q) such that 0 < vertical bar R(P-1,P-2)vertical bar <= Q(2n-2w). Our main results provide lower bounds within the context of the above problems. We believe that these bounds are best possible as they correspond to the solutions of naturally arising linear optimisation problems. Using a counting result for the number of rational points near planar curves due to R. C. Vaughan and S. Velani we also obtain the complementary optimal upper bound regarding the discriminants of quadratic polynomials. (C) 2016 The Authors. Published by Elsevier Inc.