论文信息 - Polynomial minimum root separation

Polynomial minimum root separation

The minimum root separation of an arbitrary polynomial P is defined as the minimum of the distances between distinct (real or complex) roots of P. Some asymptotically good lower bounds for the root separation of P are given, where P may have multiple zeros. There are applications in the analysis of complexity of algorithms and in the theory of algebraic and transcendental numbers.

S. Rump

[1] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[2] E. Landau,et al. Sur quelques théorèmes de M. Petrovitch relatifs aux zéros des fonctions analytiques , 1905 .

[3] W. Rogosinski,et al. The Geometry of the Zeros of a Polynomial in a Complex Variable , 1950, The Mathematical Gazette.

[4] Theodor Schneider,et al. Einführung in die transzendenten Zahlen , 1957 .

[5] K. Mahler. An application of Jensen's formula to polynomials , 1960 .

[6] A. O. Gelʹfond. Transcendental and Algebraic Numbers , 1960 .

[7] N. Obreshkov. Verteilung und Berechnung der Nullstellen reeller Polynome , 1963 .

[8] K. Mahler. An inequality for the discriminant of a polynomial. , 1964 .

[9] R. Güting,et al. Polynomials with multiple zeros , 1967 .

[10] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[11] Wolfgang M. Schmidt. Approximation to algebraic numbers , 1972 .

[12] M. Mignotte. An inequality about factors of polynomials , 1974 .

[13] Ellis Horowitz,et al. The minimum root separation of a polynomial , 1974 .

[14] Rüdiger Loos,et al. Polynomial real root isolation by differentiation , 1976, SYMSAC '76.

[15] Maurice Mignotte,et al. Some problems about polynomials , 1976, SYMSAC '76.