Search Results for ""

A polynomial factorization algorithm that proceeds by considering the vector of coefficients of a polynomial P, calculating b_i=P(i)/a_i, constructing the Lagrange ...

For an arbitrary not identically constant polynomial, the zeros of its derivatives lie in the smallest convex polygon containing the zeros of the original polynomial.

A relationship between knot polynomials for links in different orientations (denoted below as L_+, L_0, and L_-). J. H. Conway was the first to realize that the Alexander ...

If the Tutte polynomial T(x,y) of a graph G is given by sumt_(rs)x^ry^s, then the matrix (t_(rs)) is called the rank matrix of G. For example, the Tutte matrix of the ...

An operator T which maps some basic polynomial sequence p_n(x) into another basic polynomial sequence q_n(x).

The AC method is an algorithm for factoring quadratic polynomials of the form p(x)=Ax^2+Bx+C with integer coefficients. As its name suggests, the crux of the algorithm is to ...

A method of determining the maximum number of positive and negative real roots of a polynomial. For positive roots, start with the sign of the coefficient of the lowest (or ...

The Laguerre differential equation is given by xy^('')+(1-x)y^'+lambday=0. (1) Equation (1) is a special case of the more general associated Laguerre differential equation, ...

The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...

Given the Mertens function defined by M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function, Stieltjes claimed in an 1885 letter to Hermite that M(x)x^(-1/2) stays ...