Search Results for ""

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

Characteristic classes are cohomology classes in the base space of a vector bundle, defined through obstruction theory, which are (perhaps partial) obstructions to the ...

A sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that ...

Let A be a unital C^*-algebra, then an element u in A is called co-isometry if uu^*=1.

Cohomology is an invariant of a topological space, formally "dual" to homology, and so it detects "holes" in a space. Cohomology has more algebraic structure than homology, ...

A complete multipartite graph is a graph that is a complete k-partite graph for some positive integer k (Chartrand and Zhang 2008, p. 41).

A set in R^d is concave if it does not contain all the line segments connecting any pair of its points. If the set does contain all the line segments, it is called convex.

Two square matrices A and B are called congruent if there exists a nonsingular matrix P such that B=P^(T)AP, where P^(T) is the transpose.

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

A partition p is said to contain another partition q if the Ferrers diagram of p contains the Ferrers diagram of q. For example, {3,3,2} (left figure) contains both {3,3,1} ...