TOPICS
Search

Search Results for ""


5341 - 5350 of 5736 for Logistic Map R 4Search Results
The Riemann tensor (Schutz 1985) R^alpha_(betagammadelta), also known the Riemann-Christoffel curvature tensor (Weinberg 1972, p. 133; Arfken 1985, p. 123) or Riemann ...
The rising factorial x^((n)), sometimes also denoted <x>_n (Comtet 1974, p. 6) or x^(n^_) (Graham et al. 1994, p. 48), is defined by x^((n))=x(x+1)...(x+n-1). (1) This ...
The Robertson graph is the unique (4,5)-cage graph, illustrated above. It has 19 vertices and 38 edges. It has girth 5, diameter 3, chromatic number 3, and is a quartic ...
The Roman surface, also called the Steiner surface (not to be confused with the class of Steiner surfaces of which the Roman surface is a particular case), is a quartic ...
When discussing a rotation, there are two possible conventions: rotation of the axes, and rotation of the object relative to fixed axes. In R^2, consider the matrix that ...
Abstractly, a spatial configuration F is said to possess rotational symmetry if F remains invariant under the group C=C(F). Here, C(F) denotes the group of rotations of F and ...
Rubik's Cube is a 3×3×3 cube in which the 26 subcubes on the outside are internally hinged in such a way that rotation (by a quarter turn in either direction or a half turn) ...
Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...
The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...
The Schur number S(k) is the largest integer n for which the interval [1,n] can be partitioned into k sum-free sets (Fredricksen and Sweet 2000). S(k) is guaranteed to exist ...
1 ... 532|533|534|535|536|537|538 ... 574 Previous Next

...