Search Results for ""

A cubic equation is an equation involving a cubic polynomial, i.e., one of the form a_3x^3+a_2x^2+a_1x+a_0=0. Since a_3!=0 (or else the polynomial would be quadratic and not ...

The figure eight knot, also known as the Flemish knot and savoy knot, is the unique prime knot of four crossings 04-001. It has braid word ...

The zeros of the derivative P^'(z) of a polynomial P(z) that are not multiple zeros of P(z) are the positions of equilibrium in the field of force due to unit particles ...

Given a finitely generated Z-graded module M over a graded ring R (finitely generated over R_0, which is an Artinian local ring), the Hilbert function of M is the map ...

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 ...