introduction - university of wisconsin–madison.pdfVIP

PATH BUNDLES ON n-CUBES MATTHEW ELDER Abstract. A path bundle is a set of 2a paths in an n-cube, denoted Qn , such that every path has the same length, the paths partition the vertices of Qn , the endpoints of the paths induce two subcubes of Qn , and the endpoints of each path are complements. This paper shows that a path bundle exists if and only if n 0 is odd and 0 ≤ a ≤ n − ⌈log2 (n + 1)⌉. 1. Introduction Path bundles are closely related to, and emerged from, the theory of binary Gray codes. Introduced as a coding mechanism in [1], binary Gray codes have proven useful in many various technical and mathematical applications. An overview of these applications, along with many generalizations and restrictions of binary Gray codes, is given in [3]. Path bundles are largely a generalization of binary Gray codes. An n-bit binary Gray code is a list of all binary words of length n where every pair of words adjacent in the list differ by only one bit. A path bundle is a set of 2a paths in an n-cube such that every path has the same length, the paths partition the vertices of the n-cube, the endpoints of the paths induce two a-cubes of the n-cube, and the endpoints of each path are complements. This paper shows that, for positive integers n and a, there exists in an n-cube a path bundle of 2a paths if and only if n is odd and a ≤ n − ⌈log2 (n + 1)⌉. The existence result is constructive; this paper an inductive construction of some path bundle for every possible n and a that satisfy these conditions. Path bundles are likely useful for constructing binary Gray codes with various properties; they are the result of the author’s search for a construction of a variant of the Gray codes in [2]. They encapsulate many deta