ABSTRACT
In Rn , which consists of all t = (ti, · · · , tn) with entries U in R, the partial ordering s < t is defined by Sj < U for i = 1, · · · , n. Similarly s < t is defined by Sj <U for i — 1, · · · , n. Given a < b in Rn the n-cell [a, 6] consists of all t in Rn such that a < t < b. The in te rio r (a, 6) of [a, 6] consists of all t such that a < t <b. A point t is a ve rtex of [a, b] if each of its entries U equals either a* or b{. A tagged n-cell (I, t) consists of an n-cell I and a vertex t of I chosen from the 2n vertices of /.
