Search Results for ""
471 - 480 of 13135 for sign languageSearch Results
![](/common/images/search/spacer.gif)
The Thompson group is the sporadic group Th of order |Th| = 90745943887872000 (1) = 2^(15)·3^(10)·5^3·7^2·13·19·31. (2) It is implemented in the Wolfram Language as ...
A topological sort is a permutation p of the vertices of a graph such that an edge {i,j} implies that i appears before j in p (Skiena 1990, p. 208). Only acyclic digraphs can ...
In nonstandard analysis, the transfer principle is the technical form of the following intuitive idea: "Anything provable about a given superstructure V by passing to a ...
The triangular cupola is Johnson solid J_3. Its faces consist of 4 equilateral triangles, 3 squares, and 1 hexagon. It is implemented in the Wolfram Language as ...
The triangular (or trigonal) dipyramid is one of the convex deltahedra, and Johnson solid J_(12). It is also an isohedron. It is implemented in the Wolfram Language as ...
A one-sided (singly infinite) Laplace transform, L_t[f(t)](s)=int_0^inftyf(t)e^(-st)dt. This is the most common variety of Laplace transform and it what is usually meant by ...
A one-sided (singly infinite) Z-Transform, Z[{a_n}_(n=0)^infty](z)=sum_(n=0)^infty(a_n)/(z^n). This is the most common variety of Z-transform since it is essentially ...
The span of subspace generated by vectors v_1 and v_2 in V is Span(v_1,v_2)={rv_1+sv_2:r,s in R}. A set of vectors m={v_1,...,v_n} can be tested to see if they span ...
A weakly 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 ...
The Werner formulas are the trigonometric product formulas 2sinalphacosbeta = sin(alpha-beta)+sin(alpha+beta) (1) 2cosalphacosbeta = cos(alpha-beta)+cos(alpha+beta) (2) ...
![](/common/images/search/spacer.gif)
...