Search Results for ""

The ordinal number of a value in a list arranged in a specified order (usually decreasing).

A three-colorable graph G is a graph with chromatic number chi(G)<=3.

Let y_n be a complex number for 1<=n<=N and let y_n=0 if n<1 or n>N. Then (Montgomery 2001).

The natural logarithm lnx is the logarithm having base e, where e=2.718281828.... (1) This function can be defined lnx=int_1^x(dt)/t (2) for x>0. This definition means that e ...

For any ordinal number alpha, the successor of alpha is alpha union {alpha} (Ciesielski 1997, p. 46). The successor of an ordinal number alpha is therefore the next ordinal, ...

A group in which any decreasing chain of distinct subgroups terminates after a finite number.

If the average number of envelopes per pigeonhole is a, then some pigeonhole will have at least a envelopes. Similarly, there must be a pigeonhole with at most a envelopes.

The number of inward directed graph edges from a given graph vertex in a directed graph.

The word "spectrum" confusingly has a number of unrelated meanings in various branches of mathematics.

Let W(u) be a Wiener process. Then where V_t=f(W(t),tau) for 0<=tau=T-t<=T, and f in C^(2,1)((0,infty)×[0,T]). Note that while Ito's lemma was proved by Kiyoshi Ito (also ...