in [2], Choi constructs a bijection between the set of Davis-Januszkiewicz equivalence classes of small covers over an

n-cube and the set of acyclic digraphs with n-labeled nodes.

The k-ary

n-cube has many desirable properties, such as ease of implementation of algorithms and ability to reduce message latency by exploiting communication locality found in many parallel applications [8-10].

The

n-cube or n-dimensional hypercube [Q.sub.n] is recursively defined in terms of the Cartesian products.

[38], since the solid is a standard orthogonal simplex from the corner of an

n-cube. Similarly, if k [member of] (1, 2, ..., m}, then the hypervolume of [[intersection].sup.k.sub.j=1] [B.sub.j](t) is

By [BCN89, Theorem 9.2.7], it follows that [GAMMA]/[PI] is either a folded

n-cube for n [greater than or equal to] 7 or has intersection array {6,5,4; 1, 2,6}.

Topics include dark matter spiral galaxies and axioms of general relativity, embedded 3D CR manifolds and non-negativity of Paneitz operators, Aubry sets, Hamilton-Jacobi equations and Mane conjectures, minimum surfaces as eigenvalue problems, the maximal measure of sections of the

n-cube, extremities of stability for pendant drops, the Radon-Helgason inversion method in integral geometry, inequalities for the ADM-mass, and capacity of asymptotically flat manifolds with minimal boundary and bounded extrinsic curvature of subsets of metric spaces.

The

n-cube or n-dimensional hypercube [Q.sub.n] is defined recursively by [Q.sub.1] = [K.sub.2] and [Q.sub.n] = [K.sub.2] x [Q.sub.n - 1].

The 12-year dispute began in 2001 when

n-Cube Corp.

A k-ary

n-cube is defined as an interconnection structure of n dimensions having k nodes in each dimension.

Additional Key Words and Phrases: Adaptive routing, circuit switched, hypercube, interconnection networks, k-ary

n-cube, parallel processing, routing algorithms

For example, Oracle is assuming a less intelligent set-top box, and designing a video server using an

n-Cube multiprocessor system.