Search Results for ""

A square matrix is called bisymmetric if it is both centrosymmetric and either symmetric or antisymmetric (Muir 1960, p. 19).

A finite or infinite square matrix with rational entries. (If the matrix is infinite, all but a finite number of entries in each row must be 0.) The sum or product of two ...

Each of the maps in a chain complex ...->C_(i+1)->^(d_(i+1))C_i->^(d_i)C_(i-1)->... is known as a boundary operator.

The Casoratian of sequences x_n^((1)), x_n^((2)), ..., x_n^((k)) is defined by the k×k determinant C(x_n^((1)),x_n^((2)),...,x_n^((k))) =|x_n^((1)) x_n^((2)) ... x_n^((k)); ...

Any row r and column s of a determinant being selected, if the element common to them be multiplied by its cofactor in the determinant, and every product of another element ...

A square matrix is called centrosymmetric if it is symmetric with respect to the center (Muir 1960, p. 19).

Let A be a commutative ring, let C_r be an R-module for r=0, 1, 2, ..., and define a chain complex C__ of the form C__:...|->C_n|->C_(n-1)|->C_(n-2)|->...|->C_2|->C_1|->C_0. ...

Chain equivalences give an equivalence relation on the space of chain homomorphisms. Two chain complexes are chain equivalent if there are chain maps phi:C_*->D_* and ...

Also called a chain map. Given two chain complexes C_* and D_*, a chain homomorphism is given by homomorphisms alpha_i:C_i->D_i such that alpha degreespartial_C=partial_D ...

Suppose alpha:C_*->D_* and beta:C_*->D_* are two chain homomorphisms. Then a chain homotopy is given by a sequence of maps delta_p:C_p->D_(p-1) such that partial_D ...