Search Results for ""

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

A polynomial is called logarithmically concave (or log-concave) if the sequence of its coefficients is logarithmically concave. If P(x) is log-convex and Q(x) is unimodal, ...

A polynomial sequence p_n(x) is called the basic polynomial sequence for a delta operator Q if 1. p_0(x)=1, 2. p_n(0)=0 for all n>0, 3. Qp_n(x)=np_(n-1)(x). If p_n(x) is a ...

Generalizing from a straight line (i.e., first degree polynomial) to a kth degree polynomial y=a_0+a_1x+...+a_kx^k, (1) the residual is given by ...

If g(theta) is a trigonometric polynomial of degree m satisfying the condition |g(theta)|<=1 where theta is arbitrary and real, then g^'(theta)<=m.

subjMathematics:Discrete Mathematics:Graph Theory:Cliques The maximal clique polynomial C_G(x) for the graph G may be defined as the polynomial ...

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

A perfect cubic polynomial can be factored into a linear and a quadratic term, x^3+y^3 = (x+y)(x^2-xy+y^2) (1) x^3-y^3 = (x-y)(x^2+xy+y^2). (2)