On the path coding of k-faces in an n-cube

Abstract

Many constructions of topological objects in the form of cubic complexes are related to the mapping into an n-dimensional cube. The description of such mappings is a practical foundation for the algorithms devoted to the computer realization of the constructions under consideration. The combinatorial nature of the objects in use essentially increases the importance of computer representation of the information on building blocks of various dimensions. Some variants of such representations with respect to an n-dimensional cube are discussed.