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

The rank polynomial R(x,y) of a general graph G is the function defined by R(x,y)=sum_(S subset= E(G))x^(r(S))y^(s(S)), (1) where the sum is taken over all subgraphs (i.e., ...

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

An extended rooted binary tree satisfying the following conditions: 1. Every node has two children, each colored either red or black. 2. Every tree leaf node is colored ...

In the plane, the reflection property can be stated as three theorems (Ogilvy 1990, pp. 73-77): 1. The locus of the center of a variable circle, tangent to a fixed circle and ...

The triangle DeltaA^*B^*C^* obtained by reflecting the vertices of a reference triangle DeltaABC about the opposite sides is called the reflection triangle (Grinberg 2003). ...

The regular hexagon is the regular polygon with six sides, as illustrated above. The inradius r, circumradius R, sagitta s, and area A of a regular hexagon can be computed ...

The necessary condition for the polychoron to be regular (with Schläfli symbol {p,q,r}) and finite is cos(pi/q)<sin(pi/p)sin(pi/r). Sufficiency can be established by ...

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...