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 sparse polynomial square is a square of a polynomial [P(x)]^2 that has fewer terms than the original polynomial P(x). Examples include Rényi's polynomial (1) (Rényi 1947, ...

If a polynomial P(x) is divided by (x-r), then the remainder is a constant given by P(r).

A 1-variable unoriented knot polynomial Q(x). It satisfies Q_(unknot)=1 (1) and the skein relationship Q_(L_+)+Q_(L_-)=x(Q_(L_0)+Q_(L_infty)). (2) It also satisfies ...

The w-polynomials obtained by setting p(x)=3x and q(x)=-2 in the Lucas polynomial sequence. Setting f_n(1)=f_n (1) give a Fermat-Lucas number. The first few Fermat-Lucas ...

A polynomial map phi_(f), with f=(f_1,...,f_n) in (K[X_1,...,X_n])^m in a field K is called invertible if there exist g_1,...,g_m in K[X_1,...,x_n] such that ...

The Jacobsthal polynomials are the w-polynomials obtained by setting p(x)=1 and q(x)=2x in the Lucas polynomial sequence. The first few Jacobsthal-Lucas polynomials are ...

The Pell-Lucas polynomials Q(x) are the w-polynomials generated by the Lucas polynomial sequence using the generator p(x)=2x, q(x)=1. The first few are Q_1(x) = 2x (1) Q_2(x) ...

If a polynomial P(x) has a root x=a, i.e., if P(a)=0, then x-a is a factor of P(x).

A polynomial which is not necessarily an invariant of a link. It is related to the dichroic polynomial. It is defined by the skein relationship ...