Cubical complexes are defined in a manner analogous to that for simplicial complexes, the chief difference being that cubical complexes are unions of cubes rather than of simplices. A very natural cubical complex to consider is the complex C(k_1,...,k_n) where k_1,...,k_n are nonnegative integers. This complex has as its underlying space [0,k_1]x...x[0,k_n] subset of R^n with vertices at all points having integer coordinates and higher dimensional cubes formed by the vertices in the natural way. The genus of a cubical complex is defined to be the maximum genus of all surfaces that are subcomplexes of the cubical complex. A formula is given for determining the genus of the cubical complex C(k_1,...,k_n) when at least three of the k_i are odd integers. For the remaining cases a general solution is not known. When k_1=...=k_n=1 the genus of C(k_1,...,k_n) is shown to be (n-4)2^{n-3}+1 which is equivalent to the genus of the graph of the n-cube. Indeed, the genus of the complex and the genus of the graph of the 1-skeleton of the complex, are shown to be equal when at least three of the k_i are odd, but not equal in general.
| Identifer | oai:union.ndltd.org:BGMYU2/oai:scholarsarchive.byu.edu:etd-1544 |
| Date | 30 June 2005 |
| Creators | Dickson, Allen J. |
| Publisher | BYU ScholarsArchive |
| Source Sets | Brigham Young University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
| Rights | http://lib.byu.edu/about/copyright/ |
Page generated in 0.0041 seconds