Discriminant and Root Separation of Integral Polynomials
- Авторлар: Götze F.1, Zaporozhets D.2
-
Мекемелер:
- Bielefeld University
- St. Petersburg Department of the Steklov Mathematical Institute
- Шығарылым: Том 219, № 5 (2016)
- Беттер: 700-706
- Бөлім: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/238654
- DOI: https://doi.org/10.1007/s10958-016-3139-9
- ID: 238654
Дәйексөз келтіру
Аннотация
Consider a random polynomial GQ(x) = ξQ,nxn + ξQ,n − 1xn − 1 + ⋯ + ξQ,0 with independent coefficients that are 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: \( \underset{-\infty \le a\le b\le -\infty }{ \sup}\left|\mathrm{P}\left(a\frac{D\left({G}_Q\right)}{Q^{2n-2}}\le b\right)-{\displaystyle \underset{a}{\overset{b}{\int }}{\upvarphi}_n(x)dx}\right|\le \frac{C_n}{ \log Q}, \) where \( \varphi \)n denotes the probability density function of the discriminant of a random polynomial of degree n with independent coefficients that are uniformly distributed on [−1, 1]. Let Δ(GQ) denote the minimal distance between 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: \( \mathrm{P}\left({\delta}_n<\varDelta \left({G}_Q\right)<\frac{1}{\delta_n}\right)>1-\varepsilon \). Bibliography: 14 titles.
Авторлар туралы
F. Götze
Bielefeld University
Хат алмасуға жауапты Автор.
Email: goetze@math.uni-bielefeld.de
Германия, Bielefeld
D. Zaporozhets
St. Petersburg Department of the Steklov Mathematical Institute
Email: goetze@math.uni-bielefeld.de
Ресей, St. Petersburg