Search Results for ""
1151 - 1160 of 1759 for Simple Random WalkSearch Results
A polygon vertex x_i of a simple polygon P is a principal polygon vertex if the diagonal [x_(i-1),x_(i+1)] intersects the boundary of P only at x_(i-1) and x_(i+1).
The projective general linear group PGL_n(q) is the group obtained from the general linear group GL_n(q) on factoring by the scalar matrices contained in that group.
The projective general orthogonal group PGO_n(q) is the group obtained from the general orthogonal group GO_n(q) on factoring the scalar matrices contained in that group.
The projective general unitary group PGU_n(q) is the group obtained from the general unitary group GU_n(q) on factoring the scalar matrices contained in that group.
A quartic graph is a graph which is 4-regular. The unique quartic graph on five nodes is the complete graph K_5, and the unique quartic graph on six nodes is the octahedral ...
The radian is a unit of angular measure defined such that an angle of one radian subtended from the center of a unit circle produces an arc with arc length 1. A full angle is ...
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[].
If J is a simple closed curve in R^2, the closure of one of the components of R^2-J is homeomorphic with the unit 2-ball. This theorem may be proved using the Riemann mapping ...
A regular graph that is edge-transitive but not vertex-transitive is called a semisymmetric graph (Marušič and Potočnik 2001). In contrast, any graph that is both ...
A curve similar to the sine function but possibly shifted in phase, period, amplitude, or any combination thereof. The general sinusoid of amplitude a, angular frequency ...
...
View search results from all Wolfram sites (40119 matches)

