Search Results for ""

Let P be a finite partially ordered set. A chain in P is a set of pairwise comparable elements (i.e., a totally ordered subset). The partial order length of P is the maximum ...

For every p, the kernel of partial_p:C_p->C_(p-1) is called the group of cycles, Z_p={c in C_p:partial(c)=0}. (1) The letter Z is short for the German word for cycle, ...

Let A be a commutative complex Banach algebra. A nonzero homomorphism from A onto the field of complex numbers is called a character. Every character is automatically ...

The characteristic equation is the equation which is solved to find a matrix's eigenvalues, also called the characteristic polynomial. For a general k×k matrix A, the ...

A characteristic factor is a factor in a particular factorization of the totient function phi(n) such that the product of characteristic factors gives the representation of a ...

A description of an object by properties that are different from those mentioned in its definition, but are equivalent to them. The following list gives a number of examples. ...

The orthogonal polynomials defined by c_n^((mu))(x) = _2F_0(-n,-x;;-mu^(-1)) (1) = ((-1)^n)/(mu^n)(x-n+1)_n_1F_1(-n;x-n+1;mu), (2) where (x)_n is the Pochhammer symbol ...

A check which can be used to verify correct computations in a table of grouped classes. For example, consider the following table with specified class limits and frequencies ...

A Gaussian quadrature-like formula over the interval [-1,1] which has weighting function W(x)=x. The general formula is int_(-1)^1xf(x)dx=sum_(i=1)^nw_i[f(x_i)-f(-x_i)]. n ...

A number of spellings of "Chebyshev" (which is the spelling used exclusively in this work) are commonly found in the literature. These include Tchebicheff, Čebyšev, ...