TOPICS
Search

Search Results for ""


51 - 60 of 787 for Pearson SystemSearch Results
A substitution system in which rules are used to operate on a string consisting of letters of a certain alphabet. String rewriting systems are also variously known as ...
A Steiner quadruple system is a Steiner system S(t=3,k=4,v), where S is a v-set and B is a collection of k-sets of S such that every t-subset of S is contained in exactly one ...
A skewed distribution which is similar to the binomial distribution when p!=q (Abramowitz and Stegun 1972, p. 930). y=k(t+A)^(A^2-1)e^(-At), (1) for t in [0,infty) where A = ...
To solve the system of differential equations (dx)/(dt)=Ax(t)+p(t), (1) where A is a matrix and x and p are vectors, first consider the homogeneous case with p=0. The ...
A set M of all polynomials in s variables, x_1, ..., x_s such that if P, P_1, and P_2 are members, then so are P_1+P_2 and QP, where Q is any polynomial in x_1, ..., x_s.
An iterated fibration of Eilenberg-Mac lane spaces. Every topological space has this homotopy type.
A set of algebraic invariants for a quantic such that any invariant of the quantic is expressible as a polynomial in members of the set. Gordan (1868) proved the existence of ...
A set of orthogonal functions {phi_n(x)} is termed complete in the closed interval x in [a,b] if, for every piecewise continuous function f(x) in the interval, the minimum ...
Term rewriting systems are reduction systems in which rewrite rules apply to terms. Terms are built up from variables and constants using function symbols (or operations). ...
For every positive integer n, there is a unique finite sequence of distinct nonconsecutive (not necessarily positive) integers k_1, ..., k_m such that ...
1 ... 3|4|5|6|7|8|9 ... 79 Previous Next

...