Search Results for ""

Markov's theorem states that equivalent braids expressing the same link are mutually related by successive applications of two types of Markov moves. Markov's theorem is ...

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 ...

The matrix tree theorem, also called Kirchhoff's matrix-tree theorem (Buekenhout and Parker 1998), states that the number of nonidentical spanning trees of a graph G is equal ...

The McCarthy-91 function is the recursive function defined for positive integer n by M(n)={M(M(n+11)) for n<=100; n-10 for n>100. (1) It takes the value 91 for all n=1, 2, ...

The Mephisto waltz sequence is defined by beginning with 0 and then iterating the maps 0->001 and 1->110. This gives 0, 001, 001001110, 001001110001001110110110001, ... (OEIS ...

The Minkowski metric, also called the Minkowski tensor or pseudo-Riemannian metric, is a tensor eta_(alphabeta) whose elements are defined by the matrix (eta)_(alphabeta)=[-1 ...

The unique 8_3 configuration. It is transitive and self-dual, but cannot be realized in the real projective plane. Its Levi graph is the Möbius-Kantor graph.

A second-order partial differential equation of the form Hr+2Ks+Lt+M+N(rt-s^2)=0, (1) where H, K, L, M, and N are functions of x, y, z, p, and q, and r, s, t, p, and q are ...

A monoid is a set that is closed under an associative binary operation and has an identity element I in S such that for all a in S, Ia=aI=a. Note that unlike a group, its ...