Search Results for ""

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[].

A generalization of the Bessel differential equation for functions of order 0, given by zy^('')+y^'+(z+A)y=0. Solutions are y=e^(+/-iz)_1F_1(1/2∓1/2iA;1;∓2iz), where ...

A smooth curve is a curve which is a smooth function, where the word "curve" is interpreted in the analytic geometry context. In particular, a smooth curve is a continuous ...

The locus of points whose first polars with regard to the curves of a linear net have a common point. It is also the locus of points of concurrence of line polars of points ...

The Suzuki group is the sporadic group Suz of order |Suz| = 448345497600 (1) = 2^(13)·3^7·5^2·7·11·13. (2) It is implemented in the Wolfram Language as SuzukiGroupSuz[].

Let p be a prime number, G a finite group, and |G| the order of G. 1. If p divides |G|, then G has a Sylow p-subgroup. 2. In a finite group, all the Sylow p-subgroups are ...

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 ...