Squeezing Polynomial Roots a Nonuniform Distance
نویسنده
چکیده
Given a polynomial with all real roots, the Polynomial Root Squeezing Theorem states that moving two roots an equal distance toward each other, without passing other roots, will cause each critical point to move toward (ri + rj)/2, or remain fixed. In this note, we extend the Polynomial Root Squeezing Theorem to the case where two roots are squeezed together a nonuniform distance.
منابع مشابه
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...
متن کاملPolynomial Root Motion
A polynomial is determined by its roots and its leading coefficient. If you set the roots in motion, the critical points will move too. Using only tools from the undergraduate curriculum, we find an inverse square law that determines the velocities of the critical points in terms of the positions and velocities of the roots. As corollaries we get the Polynomial Root Dragging Theorem and the Pol...
متن کامل1-D Sampling Using Nonuniform Samples and Bessel Functions
We develop the nth order Fourier-Bessel series expansion of 1-D functions in the interval (0,α). Hence we establish the sampling theorem for a function with α-bandlimited nth order Hankel transform. The latter statement implies that the function is also Fourier transform αbandlimited. The samples’ locations are given by the roots of nth order Bessel functions. In addition, the sampling distance...
متن کاملChebyshev nonuniform sampling cascaded with the discrete cosine transform for optimum interpolation
This correspondence presents a new method for discrete representation of signals { g ( t ) , IE [ O , L ] , g e C*(O, L ) } consisting of a cascade having two stages: a) nonuniform sampling according to Chebyshev polynomial roots; and b) discrete cosine transform applied on the nonuniformly taken samples. We have proved that the considered signal samples and the coefficients of the correspondin...
متن کامل. N A ] 1 1 Se p 20 06 A note on the location of polynomial roots
We review some known inclusion results for the roots of a polynomial, and adapt them to a conjecture recently presented by S. A. Vavasis. In particular, we provide strict upper and lower bounds to the distance of the closest root of a polynomial p(z) from a given ζ ∈ C such that p ′ (ζ) = 0.
متن کامل