Search Results for ""

A self-organizing data structure which uses rotations to move any accessed key to the root. This leaves recently accessed nodes near the top of the tree, making them very ...

A sequence of approximations a/b to sqrt(n) can be derived by factoring a^2-nb^2=+/-1 (1) (where -1 is possible only if -1 is a quadratic residue of n). Then ...

The Steenrod algebra has to do with the cohomology operations in singular cohomology with integer mod 2 coefficients. For every n in Z and i in {0,1,2,3,...} there are ...

If X is any compact space, let A be a subalgebra of the algebra C(X) over the reals R with binary operations + and ×. Then, if A contains the constant functions and separates ...

A second-tensor rank symmetric tensor is defined as a tensor A for which A^(mn)=A^(nm). (1) Any tensor can be written as a sum of symmetric and antisymmetric parts A^(mn) = ...

In the tabu search category of meta-heuristics, the essential idea is to 'forbid' search moves to points already visited in the (usually discrete) search space, at least for ...

Prellberg (2001) noted that the limit c=lim_(n->infty)(T_n)/(B_nexp{1/2[W(n)]^2})=2.2394331040... (OEIS A143307) exists, where T_n is a Takeuchi number, B_n is a Bell number, ...

The "ternary" Champernowne constant can be defined by concatenating the ternary representations of the integers C_3 = 0.(1)(2)(1,0)(1,1)(1,2)(2,0)..._3 (1) = ...

The transitive closure of a binary relation R on a set X is the minimal transitive relation R^' on X that contains R. Thus aR^'b for any elements a and b of X provided that ...

A minimal surface discovered by L. P. M. Jorge and W. Meeks III in 1983 with Enneper-Weierstrass parameterization f = 1/((zeta^3-1)^2) (1) g = zeta^2 (2) (Dickson 1990). ...