Search Results for ""

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings in ...

A root of a polynomial P(z) is a number z_i such that P(z_i)=0. The fundamental theorem of algebra states that a polynomial P(z) of degree n has n roots, some of which may be ...

The Hermite polynomials H_n(x) are set of orthogonal polynomials over the domain (-infty,infty) with weighting function e^(-x^2), illustrated above for n=1, 2, 3, and 4. ...

A knot invariant in the form of a polynomial such as the Alexander polynomial, BLM/Ho Polynomial, bracket polynomial, Conway polynomial, HOMFLY polynomial, Jones polynomial, ...

A rational polynomial is a polynomial having rational coefficients. While the term "rational polynomial" is sometimes used as a synonym for rational function, this usage is ...

The remainder R(x) obtained when dividing a polynomial p(x) by another polynomial q(x). The polynomial remainder is implemented in the Wolfram Language as ...

A complex polynomial is a polynomial with complex coefficients.

A multivariate polynomial (i.e., a polynomial in more than one variable) with all terms having the same degree. For example, x^3+xyz+y^2z+z^3 is a homogeneous polynomial of ...

The bracket polynomial is one-variable knot polynomial related to the Jones polynomial. The bracket polynomial, however, is not a topological invariant, since it is changed ...