Discriminant and root separation of integral polynomials
Abstract
Consider a random polynomial GQ(x)=Q,nxn+Q,n-1xn-1+...+Q,0 with independent coefficients uniformly distributed on 2Q+1 integer points \-Q, ..., Q\. Denote by D(GQ) the discriminant of GQ. We show that there exists a constant Cn, depending on n only such that for all Q 2 the distribution of D(GQ) can be approximated as follows -∞≤ a≤ b≤∞|P(a≤ D(GQ)Q2n-2≤ b)-∫abn(x)\, dx|≤Cn Q, where n denotes the distribution function of the discriminant of a random polynomial of degree n with independent coefficients which are uniformly distributed on [-1,1]. Let (GQ) denote the minimal distance between the complex roots of GQ. As an application we show that for any >0 there exists a constant δn>0 such that (GQ) is stochastically bounded from below/above for all sufficiently large Q in the following sense P(δn<(GQ)<1δn)>1- .
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.