Search Results for ""

A set of maximum degree to which all other degrees of recursively enumerable sets can be many-one reduced. If set A is many-one complete, then it is one-one complete, and ...

Let Y^X be the set of continuous mappings f:X->Y. Then the topological space for Y^X supplied with a compact-open topology is called a mapping space.

A type I move (conjugation) takes AB->BA for A, B in B_n where B_n is a braid group. A type II move (stabilization) takes A->Ab_n or A->Ab_n^(-1) for A in B_n, and b_n, Ab_n, ...

A random process whose future probabilities are determined by its most recent values. A stochastic process x(t) is called Markov if for every n and t_1<t_2...<t_n, we have ...

The statistical index P_(ME)=(sump_n(q_0+q_n))/(sum(v_0+v_n)), where p_n is the price per unit in period n, q_n is the quantity produced in period n, and v_n=p_nq_n is the ...

Matrix decomposition refers to the transformation of a given matrix (often assumed to be a square matrix) into a given canonical form.

A maximal independent set is an independent set which is a maximal set, i.e., an independent set that is not a subset of any other independent set. The generic term "maximal ...

The ring of integers of a number field K, denoted O_K, is the set of algebraic integers in K, which is a ring of dimension d over Z, where d is the extension degree of K over ...

The mean square displacement (MSD) of a set of N displacements x_n is given by <|x|^2>=sum_(k=1)^N|x_k|^2. It arises particularly in Brownian motion and random walk problems. ...

In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...