Search Results for ""

A packing of polyhedron in three-dimensional space. A polyhedron which can pack with no holes or gaps is said to be a space-filling polyhedron. Betke and Henk (2000) present ...

Polykites are polyforms obtained from a regular triangular grid superposed on a regular hexagonal grid (its dual), illustrated above. The monokite is therefore a ...

Suppose that V={(x_1,x_2,x_3)} and W={(x_1,0,0)}. Then the quotient space V/W (read as "V mod W") is isomorphic to {(x_2,x_3)}=R^2. In general, when W is a subspace of a ...

A random closed set (RACS) in R^d is a measurable function from a probability space (Omega,A,P) into (F,Sigma) where F is the collection of all closed subsets of R^d and ...

A ring homomorphism is a map f:R->S between two rings such that 1. Addition is preserved:f(r_1+r_2)=f(r_1)+f(r_2), 2. The zero element is mapped to zero: f(0_R)=0_S, and 3. ...

The snub icosidodecadodecahedron is the uniform polyhedron with Maeder index 46 (Maeder 1997), Wenninger index 112 (Wenninger 1989), Coxeter index 58 (Coxeter et al. 1954), ...

A square matrix U is a special unitary matrix if UU^*=I, (1) where I is the identity matrix and U^* is the conjugate transpose matrix, and the determinant is detU=1. (2) The ...

A tetramagic cube is a magic cube that remains magic when all its numbers are squared, cubed, and taken to the fourth power. Only two tetramagic cubes are known, and both ...

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

A graph for which the relations between pairs of vertices are symmetric, so that each edge has no directional character (as opposed to a directed graph). Unless otherwise ...