Search Results for ""

A general formula giving the number of distinct ways of folding an m×n rectangular map is not known. A distinct folding is defined as a permutation of N=m×n numbered cells ...

A sequence of random variates X_0, X_1, ... with finite means such that the conditional expectation of X_(n+1) given X_0, X_1, X_2, ..., X_n is equal to X_n, i.e., ...

An n×m matrix A^- is a 1-inverse of an m×n matrix A for which AA^-A=A. (1) The Moore-Penrose matrix inverse is a particular type of 1-inverse. A matrix equation Ax=b (2) has ...

A Banach space X is called minimal if every infinite-dimensional subspace Y of X contains a subspace Z isomorphic to X. An example of a minimal Banach space is the Banach ...

A class of automata similar to cellular automata but which have a single "active" cell instead of updating all cells in parallel. In a mobile automaton, the evolution rules ...

The length of all composition series of a module M. According to the Jordan-Hölder theorem for modules, if M has any composition series, then all such series are equivalent. ...

The monster group is the highest order sporadic group M. It has group order |M| = (1) = (2) where the divisors are precisely the 15 supersingular primes (Ogg 1980). The ...

In order to integrate a function over a complicated domain D, Monte Carlo integration picks random points over some simple domain D^' which is a superset of D, checks whether ...

A square-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...

A nonzero vector v=(v_0,v_1,...,v_(n-1)) in n-dimensional Lorentzian space R^(1,n-1) is said to be negative lightlike if it has zero (Lorentzian) norm and if its first ...