Search Results for ""

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

(e^(ypsi_0(x))Gamma(x))/(Gamma(x+y))=product_(n=0)^infty(1+y/(n+x))e^(-y/(n+x)), where psi_0(x) is the digamma function and Gamma(x) is the gamma function.

A line of constant longitude on a spheroid (or sphere). More generally, a meridian of a surface of revolution is the intersection of the surface with a plane containing the ...

A group G such that the quotient group G/Z(G), where Z(G) is the group center of G, is Abelian. An equivalent condition is that the commutator subgroup G^' is contained in ...

A particular way of doing something, sometimes also called an algorithm or procedure. (According to Petkovšek et al. (1996), "a method is a trick that has worked at least ...

The minimum excluded value. The mex of a set S of nonnegative integers is the least nonnegative integer not in the set.

Given order statistics Y_1=min_(j)X_j, Y_2, ..., Y_(N-1), Y_N=max_(j)X_j with sample size N, the midrange of the random sample is defined by MR=1/2(Y_1+Y_N) (Hogg and Craig ...

A minimal vertex cut is an vertex cut of a graph that is not a proper subset of any other vertex cut. Every minimum vertex cut is a minimal vertex cut, but the converse does ...