Search Results for ""

The shear matrix e_(ij)^s is obtained from the identity matrix by inserting s at (i,j), e.g., e_(12)^s=[1 s 0; 0 1 0; 0 0 1]. (1) Bolt and Hobbs (1998) define a shear matrix ...

Johnson solid J_4. The bottom eight polyhedron vertices are (+/-1/2(1+sqrt(2)),+/-1/2,0),(+/-1/2,+/-1/2(1+sqrt(2)),0), and the top four polyhedron vertices are ...

The polyhedral formula generalized to a surface of genus g, V-E+F=chi(g) where V is the number of polyhedron vertices, E is the number of polyhedron edges, F is the number of ...

In random number computation, a seed is an initial number used as the starting point in a random number generating algorithm. In a dynamical system, a seed is a starting ...

A branch cut is a curve (with ends possibly open, closed, or half-open) in the complex plane across which an analytic multivalued function is discontinuous. For convenience, ...

The Hadwiger-Nelson problem asks for the chromatic number of the plane, i.e., the minimum number of colors needed to color the plane if no two points at unit distance one ...

A map is called "one-to-one" (or "1:1") if it is injective. However, being in "one-to-one correspondence" is synonymous with being a bijection. Unfortunately, this confusing ...

What is the area of the largest square that can be inscribed on a unit cube (Trott 2004, p. 104)? The answer is 9/8, given by a square with vertices (1/4, 0, 0), (0, 1, 1/4), ...

The pair of sequences defined by F(0)=1, M(0)=0, and F(n) = n-M(F(n-1)) (1) M(n) = n-F(M(n-1)). (2) The first few terms of the "male" sequence M(n) for n=0, 1, ... are 0, 0, ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...