Search Results for ""

A sorting method proposed by Shell (1959) in which records being sorted can take long jumps instead of being restricted to short steps.

Let v(G) be the number of vertices in a graph G and h(G) the length of the maximum cycle in G. Then the shortness exponent of a class of graphs G is defined by sigma(G)=lim ...

The single bar | is a notation variously used to denote the absolute value |x|, complex modulus |z|, vector norm |x|, determinant |A|, or "divides" (a|b).

The function from a given nonempty set X to the power set P(X) that maps every element x of X to the set {x}.

The Stolarsky mean of two numbers a and c is defined by S_p(a,c)=[(a^p-c^p)/(p(a-c))]^(1/(p-1)) (Havil 2003, p. 121).

A generalization of Ramsey theory to mathematical objects in which one would not normally expect structure to be found. For example, there exists a graph with very few ...

If a subset S of the elements of a field F satisfies the field axioms with the same operations of F, then S is called a subfield of F. In a finite field of field order p^n, ...

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 condition which, if true, guarantees that a result is also true. (However, the result may also be true if the condition is not met.) If a condition is both necessary and ...

A tetractys, also called a tetraktys or decad, is an arrangement of 10 points in the form of a triangle with 1 point in the first row, two in the second, three in the third, ...