TOPICS
Search

Search Results for ""


7111 - 7120 of 13135 for Computational GeometrySearch Results
A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...
A formula of first-order logic is said to be in Skolemized form (sometimes also called Skolem standard form or universal form) if it is of the form forall x_1... forall x_nM, ...
Slater (1960, p. 31) terms the identity _4F_3[a,1+1/2a,b,-n; 1/2a,1+a-b;1+a+n]=((1+a)_n(1/2+1/2a-b)_n)/((1/2+1/2a)_n(1+a-b)_n) for n a nonnegative integer the "_4F_3[1] ...
The Reidemeister move of type III.
Assemble six 1×2×2 blocks and three 1×1×1 blocks into a 3×3×3 cube.
A moving average may generate an irregular oscillation even if none exists in the original data.
The space of immersions of a manifold in another manifold is homotopically equivalent to the space of bundle injections from the tangent space of the first to the tangent ...
If M^n is a differentiable homotopy sphere of dimension n>=5, then M^n is homeomorphic to S^n. In fact, M^n is diffeomorphic to a manifold obtained by gluing together the ...
An algorithm for computing an Egyptian fraction.
A submodule S of a module M such that for any proper submodule T of M, the submodule generated by S union T is not the entire module M. S is also called superfluous submodule.
1 ... 709|710|711|712|713|714|715 ... 1314 Previous Next

...