No label defined (Q4409696)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1943120
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1943120 |
Statements
26 November 2003
0 references
polynomials
0 references
real zeros
0 references
asymptotic behaviour
0 references
0.8620121479034424
0 references
0.8495998978614807
0 references
0.8462372422218323
0 references
0.843083381652832
0 references
0.8340378403663635
0 references
The present authors, well-known for their papers in the field, review the most important results on the real roots of polynomials with real coefficients. The paper begins with the well-known theorem of R. Descartes from 1637 (a theorem which is in fact attributed by John Wallis to Hariot (1631)). Sturm's method (1829) is also mentioned. Some results of probabilistic nature are then presented. For a polynomial \(f=\sum_{k=0}^na_kX^k\) coefficients \(a_0,a_1,\dots,a_n\) are real independent random variables with standard normal distribution we denote by \(N(n)\) the expected number of real roots. Mark Kac (1943, 1949) showed that \(N(n)=\frac{2}{\pi}\log n+O(1)\). The explicit formula for \(N(n)\) is now known. For the polynomials with \(a_i=\pm1, i=0,1,2,\dots,n\) the authors present the evolution of the estimates for \(N(n)\) given by Bloch and Pólya (1932), Littlewood and Offord (1938, 1939) and Erdős and Offord (1956). For the general polynomials, we mention the result of Edelman and Kostlan which states that \(N(n)=\frac{2}{\pi}\log n+0,625...+\frac{2}{n\pi}+O\left(\frac{1}{n^2}\right)\). For the series \(\sum_{i=0}^\infty a_iX^i\) the \(n\)th prefix polynomial is defined as \(f=\sum_{i=0}^n a_iX^i\). If we denote \((a_n)_n\) by \(\underline a\) and by \(Z(\underline a,n)\) the number of real zeros of the \(n^{th}\) prefix polynomial, we have \(Z(\underline a,n)\sim \frac{2}{\pi}\log n\) and \[ \liminf_{n\to \infty}\frac{Z(\underline a,n)}{\log n}\leq\frac{2}{\pi}\leq \limsup_{n\to \infty}\frac{Z(\underline a,n)}{\log n}. \] If \(n\geq0\), \(s(n)\) is the sum of its binary digits and \(\epsilon_n=(-1)^{s(n)}\), then \[ \lim_{n\to \infty} \frac{1}{n}\sum_{k=0}^\infty Z(\underline \epsilon, k)=\frac{11}{4}. \] Finally, the problem of computing real algebraic numbers and their complexity is discussed and the authors are referring to the first papers in this area, belonging to Cucker and Roy (1990) and Mendès France (1991). For the entire collection see [Zbl 1006.00014].
0 references