Search Results for ""

A nonuniform rational B-spline curve defined by C(t)=(sum_(i=0)^(n)N_(i,p)(t)w_iP_i)/(sum_(i=0)^(n)N_(i,p)(t)w_i), where p is the order, N_(i,p) are the B-spline basis ...

The O'Nan group is the sporadic group O'N of order |O'N| = 460815505920 (1) = 2^9·3^4·5·7^3·11·19·31. (2) It is implemented in the Wolfram Language as ONanGroupON[].

Let (A,<=) and (B,<=) be well ordered sets with ordinal numbers alpha and beta. Then alpha<beta iff A is order isomorphic to an initial segment of B (Dauben 1990, p. 199). ...

For a system of n first-order ordinary differential equations (or more generally, Pfaffian forms), the 2n-dimensional space consisting of the possible values of ...

The derivative identity d/(dx)[f(x)g(x)] = lim_(h->0)(f(x+h)g(x+h)-f(x)g(x))/h (1) = (2) = lim_(h->0)[f(x+h)(g(x+h)-g(x))/h+g(x)(f(x+h)-f(x))/h] (3) = f(x)g^'(x)+g(x)f^'(x), ...

A diagram used in the solution of ordinary differential equations of the form (dw)/(dz)=(g(z,w))/(h(z,q)) which vanish when z=0, where g(0,0)=h(0,0)=0 (Ince 1956, pp. 298 and ...

An estimation technique which is insensitive to small departures from the idealized assumptions which have been used to optimize the algorithm. Classes of such techniques ...

A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...

Rubik's group is the group corresponding to possible rotations of a Rubik's Cube. There are six possible rotations, each corresponding to a generator of the group, and the ...

The Rudvalis group is the sporadic group Ru of order |Ru| = 145926144000 (1) = 2^(14)·3^3·5^3·7·13·29. (2) It is implemented in the Wolfram Language as RudvalisGroupRu[].