TOPICS
Search

Search Results for ""


301 - 310 of 2130 for Matrix polynomialSearch Results
The polynomials G_n(x;a,b) given by the associated Sheffer sequence with f(t)=e^(at)(e^(bt)-1), (1) where b!=0. The inverse function (and therefore generating function) ...
The Legendre polynomials, sometimes called Legendre functions of the first kind, Legendre coefficients, or zonal harmonics (Whittaker and Watson 1990, p. 302), are solutions ...
A polynomial that represents integers for all integer values of the variables. An integer polynomial is a special case of such a polynomial. In general, every integer ...
Let f be an integer polynomial. The f can be factored into a product of two polynomials of lower degree with rational coefficients iff it can be factored into a product of ...
The eight Gell-Mann matrices lambda_i, i=1,...,8, are an example of the set of generators of the Lie algebra associated to the special unitary group SU(3). Explicitly, these ...
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 ...
1 ... 28|29|30|31|32|33|34 ... 213 Previous Next

...