Search Results for ""

There are two equivalent definitions for a nilpotent matrix. 1. A square matrix whose eigenvalues are all 0. 2. A square matrix A such that A^n is the zero matrix 0 for some ...

A function f(n) has the normal order F(n) if f(n) is approximately F(n) for almost all values of n. More precisely, if (1-epsilon)F(n)<f(n)<(1+epsilon)F(n) for every positive ...

The study of numbers for the supposed purpose of predicting future events or seeking connections with the occult.

Obstruction theory studies the extensibility of maps using algebraic gadgets. While the terminology rapidly becomes technical and convoluted (as Iyanaga and Kawada (1980) ...

The theory and applications of Laplace transforms and other integral transforms.

The oriented matroid of a finite configuration of points extracts relative position and orientation information from the configuration. An oriented matroid can be described ...

An orthogonal array OA(k,s) is a k×s^2 array with entries taken from an s-set S having the property that in any two rows, each ordered pair of symbols from S occurs exactly ...

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

1. Zero is a number. 2. If a is a number, the successor of a is a number. 3. zero is not the successor of a number. 4. Two numbers of which the successors are equal are ...

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...