Search Results for ""

For any algebraic number x of degree n>2, a rational approximation p/q to x must satisfy |x-p/q|>1/(q^n) for sufficiently large q. Writing r=n leads to the definition of the ...

Little's law states that, under steady state conditions, the average number of items in a queuing system equals the average rate at which the items arrive multiplied by the ...

The log-likelihood function F(theta) is defined to be the natural logarithm of the likelihood function L(theta). More precisely, F(theta)=lnL(theta), and so in particular, ...

Let x=(x_1,x_2,...,x_n) and y=(y_1,y_2,...,y_n) be nonincreasing sequences of real numbers. Then x majorizes y if, for each k=1, 2, ..., n, sum_(i=1)^kx_i>=sum_(i=1)^ky_i, ...

Mann's theorem is a theorem widely circulated as the "alpha-beta conjecture" that was subsequently proven by Mann (1942). It states that if A and B are sets of integers each ...

A subset E of a topological space S is said to be meager if E is of first category in S, i.e., if E can be written as the countable union of subsets which are nowhere dense ...

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 sequence produced by starting with a_1=1 and applying the greedy algorithm in the following way: for each k>=2, let a_k be the least integer exceeding a_(k-1) for which ...

A morphism is a map between two objects in an abstract category. 1. A general morphism is called a homomorphism, 2. A morphism f:Y->X in a category is a monomorphism if, for ...

Let F,G:C->D be functors between categories C and D. A natural transformation Phi from F to G consists of a family Phi_C:F(C)->G(C) of morphisms in D which are indexed by the ...