Search Results for ""

The W-polynomials obtained by setting p(x)=3x and q(x)=-2 in the Lucas polynomial sequence. The first few Fermat polynomials are F_1(x) = 1 (1) F_2(x) = 3x (2) F_3(x) = ...

In every residue class modulo p, there is exactly one integer polynomial with coefficients >=0 and <=p-1. This polynomial is called the normal polynomial modulo p in the ...

A curve obtained by fitting polynomials to each ordinate of an ordered sequence of points. The above plots show polynomial curves where the order of the fitting polynomial ...

A quadratic polynomial is a polynomial of degree 2. A univariate quadratic polynomial has the form f(x)=a_2x^2+a_1x+a_0. An equation involving a quadratic polynomial is ...

A factor of a polynomial P(x) of degree n is a polynomial Q(x) of degree less than n which can be multiplied by another polynomial R(x) of degree less than n to yield P(x), ...

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

The characteristic polynomial is the polynomial left-hand side of the characteristic equation det(A-lambdaI)=0, (1) where A is a square matrix and I is the identity matrix of ...

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 rank polynomial R(x,y) of a general graph G is the function defined by R(x,y)=sum_(S subset= E(G))x^(r(S))y^(s(S)), (1) where the sum is taken over all subgraphs (i.e., ...

The coboundary polynomial chi^__G(q,t) is a bivariate graph polynomial which can be expressed in terms of the Tutte polynomial T_G(x,y) of a graph G by ...