Search Results for ""

The concept of "random close packing" was shown by Torquato et al. (2000) to be mathematically ill-defined idea that is better replaced by the notion of "maximally random ...

A random walk is a sequence of discrete steps in which each step is randomly taken subject to some set of restrictions in allowed directions and step lengths. Random walks ...

Any square matrix T has a canonical form without any need to extend the field of its coefficients. For instance, if the entries of T are rational numbers, then so are the ...

The real projective plane is the closed topological manifold, denoted RP^2, that is obtained by projecting the points of a plane E from a fixed point P (not on the plane), ...

The resolution principle, due to Robinson (1965), is a method of theorem proving that proceeds by constructing refutation proofs, i.e., proofs by contradiction. This method ...

The rhombic triacontahedron is a zonohedron which is the dual polyhedron of the icosidodecahedron A_4 (Holden 1971, p. 55). It is Wenninger dual W_(12). It is composed of 30 ...

For a real positive t, the Riemann-Siegel Z function is defined by Z(t)=e^(itheta(t))zeta(1/2+it). (1) This function is sometimes also called the Hardy function or Hardy ...

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 rising sun graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RisingSunGraph"].

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