Search Results for ""

A polynomial with matrix coefficients. An nth order matrix polynomial in a variable t is given by P(t)=A_0+A_1t+A_2t^2+...+A_nt^n, where A_k are p×p square matrices.

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

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

P_n(cosalpha)=(sqrt(2))/piint_0^alpha(cos[(n+1/2)phi])/(sqrt(cosphi-cosalpha))dphi, where P_n(x) is a Legendre polynomial.

A well ordered set of monomials which also satisfies the condition "u<v implies uw<vw" for all monomials u, v, and w. Examples of monomial orders are the lexicographic order ...

An algebraic expression containing more than one term (cf., binomial). The term is also used to refer to a polynomial.

The second-order ordinary differential equation satisfied by the Neumann polynomials O_n(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 ...