Search Results for ""

A noncylindrical ruled surface always has a parameterization of the form x(u,v)=sigma(u)+vdelta(u), (1) where |delta|=1, sigma^'·delta^'=0, and sigma is called the striction ...

A substitution system in which rules are used to operate on a string consisting of letters of a certain alphabet. String rewriting systems are also variously known as ...

A pseudoprime which obeys an additional restriction beyond that required for a Frobenius pseudoprime. A number n with (n,2a)=1 is a strong Frobenius pseudoprime with respect ...

The sequence of variates X_i with corresponding means mu_i obeys the strong law of large numbers if, to every pair epsilon,delta>0, there corresponds an N such that there is ...

Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Let n be an odd composite number with (n,D)=1, and n-(D/n)=2^sd with d odd and s>=0, ...

A strong pseudo-Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is symmetric and for which, at each m in M, the map v_m|->g_m(v_m,·) is an ...

A strong Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is both a strong pseudo-Riemannian metric and positive definite. In a very precise way, the ...

A strongly binary tree is a rooted tree for which the root is adjacent to either zero or two vertices, and all non-root vertices are adjacent to either one or three vertices ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...