✍ Scribed by Laureano Gonzalez-Vega; Henri Lombardi; Louis Mahé
No coin nor oath required. For personal study only.
The fact that a real univariate polynomial misses some real roots is usually overcome by considering complex roots, but the price to pay for, is a complete loss of the sign structure that a set of real roots is endowed with (mutual position on the line, signs of the derivatives, etc.). In this paper we present real substitutes for these missing roots which keep sign properties and which extend of course the existing roots. Moreover these "virtual roots" are the values of semialgebraic continuous -rather uniformly -functions defined on the set of monic polynomials. We present some applications. @ 1998 Elsevier Science B.V.
📜 SIMILAR VOLUMES
An explicit criterion for the determination of the numbers and multiplicities of the real/imaginary roots for polynomials with symbolic coefficients is based on a Complete Discrimination System (CDS). A CDS is a set of explicit expressions in terms of the coefficients that are sufficient for determi
In this paper we count the number (0,k) n , k n -1, of connected components in the space ∆ (0,k) n of all real degree n polynomials which a) have all their roots real and simple; and b) have no common root with their kth derivatives. In this case, we show that the only restriction on the arrangement
It is proved that the chromatic polynomial of a connected graph with n vertices and m edges has a root with modulus at least (m&1)Â(n&2); this bound is best possible for trees and 2-trees (only). It is also proved that the chromatic polynomial of a graph with few triangles that is not a forest has a
In general , not every set of values modulo n will be the set of roots modulo n of some polynomial . In this note , some characteristics of those sets which are root sets modulo a prime power are developed , and these characteristics are used to determine the number of dif ferent sets of integers wh