Polynomial Roots: The Ultimate Answer?
نویسندگان
چکیده
We show that it is always possible to transform the problem of tìnding the mots of a generic polynomial to the problem of determining the eigenvalues of tridiagonal matrices having only simple eigenvalues. Since this problem is very effìciently solved, for example with the familiar QR method, it seems that the present veIy simple approach bas the potentiality to supplant the existing ones.
منابع مشابه
On the Roots of Hosoya Polynomial of a Graph
Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...
متن کاملChromatic Roots and Minor-Closed Families of Graphs
Given a minor-closed class of graphs G, what is the infimum of the non-trivial roots of the chromatic polynomial of G ∈ G? When G is the class of all graphs, the answer is known to be 32/27. We answer this question exactly for three minorclosed classes of graphs. Furthermore, we conjecture precisely when the value is larger than 32/27.
متن کاملEffective Positivity Problems for Simple Linear Recurrence Sequences
We consider two computational problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (determine whether all terms of a given LRS are positive) and the effective Ultimate Positivity Problem (determine whether all but finitely many terms of a given LRS are positive, and if so, compute an index threshold beyond which all terms are positive). We show that, f...
متن کاملOn the real roots of generalized Thue-Morse polynomials
In this article we investigate real roots of real polynomials. By results of M. Kac 8, 9, 10] we know that a polynomial of degree n has in average 2 log n real zeros. See also results of Edelman and Kostlan 5] on the same subject. Some 10 years later Erdds and OOord 7] proved that the mean number of real roots of a random polynomial of degree n with coeecients 1 is again 2 log n: This leads us ...
متن کاملUltimate Positivity is Decidable for Simple Linear Recurrence Sequences
We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine approximation concerning sums of S-units, we show that for simple LRS (those whose characteristic polynomial has no repeated roots) the Ultimate Positivity Problem is de...
متن کامل