Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Discriminant and root separation of integral polynomials (1407.6388v2)

Published 23 Jul 2014 in math.NT and math.PR

Abstract: Consider a random polynomial $$ G_Q(x)=\xi_{Q,n}xn+\xi_{Q,n-1}x{n-1}+...+\xi_{Q,0} $$ with independent coefficients uniformly distributed on $2Q+1$ integer points ${-Q, ..., Q}$. Denote by $D(G_Q)$ the discriminant of $G_Q$. We show that there exists a constant $C_n$, depending on $n$ only such that for all $Q\ge 2$ the distribution of $D(G_Q)$ can be approximated as follows $$ \sup_{-\infty\leq a\leq b\leq\infty}|\mathbb{P}(a\leq \frac{D(G_Q)}{Q{2n-2}}\leq b)-\int_ab\varphi_n(x)\, dx|\leq\frac{C_n}{\log Q}, $$ where $\varphi_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 $\Delta(G_Q)$ denote the minimal distance between the complex roots of $G_Q$. As an application we show that for any $\varepsilon>0$ there exists a constant $\delta_n>0$ such that $\Delta(G_Q)$ is stochastically bounded from below/above for all sufficiently large $Q$ in the following sense $$ \mathbb{P}(\delta_n<\Delta(G_Q)<\frac1{\delta_n})>1-\varepsilon . $$

Summary

We haven't generated a summary for this paper yet.