Inaug.-diss.--Basel. / "Curriculum vitae": p. 34. "Spiethoffs schriften": p. 6.

Inaug.-diss.--Erlangen. / Lebenslauf. "Literaturverzeichnis": p. 99-102.

Texte remanié de: Th. Ph. degree--Columbia university, 1953. / Bibliogr. p. 211-222. Index.

Thesis (M. Soc. Sc.)--University of Hong Kong, 1991.

Thesis (M.Soc.Sc.)--University of Hong Kong, 1991. / Also available in print.

No description available.

Thesis (Ph. D.)--Brandeis University, 2003. / "UMI:3096565." Includes bibliographical references.

No description available.

abstract: Gray codes are perhaps the best known structures for listing sequences of combinatorial objects, such as binary strings. Simply defined as a minimal change listing, Gray codes vary greatly both in structure and in the types of objects that they list. More specific types of Gray codes are universal cycles and overlap sequences. Universal cycles are Gray codes on a set of strings of length n in which the first n-1 letters of one object are the same as the last n-1 letters of its predecessor in the listing. Overlap sequences allow this overlap to vary between 1 and n-1. Some of our main contributions to the areas of Gray codes and universal cycles include a new Gray code algorithm for fixed weight m-ary words, and results on the existence of universal cycles for weak orders on [n]. Overlap cycles are a relatively new structure with very few published results. We prove the existence of s-overlap cycles for k-permutations of [n], which has been an open research problem for several years, as well as constructing 1- overlap cycles for Steiner triple and quadruple systems of every order. Also included are various other results of a similar nature covering other structures such as binary strings, m-ary strings, subsets, permutations, weak orders, partitions, and designs. These listing structures lend themselves readily to some classes of combinatorial objects, such as binary n-tuples and m-ary n-tuples. Others require more work to find an appropriate structure, such as k-subsets of an n-set, weak orders, and designs. Still more require a modification in the representation of the objects to fit these structures, such as partitions. Determining when and how we can fit these sets of objects into our three listing structures is the focus of this dissertation. / Dissertation/Thesis / Ph.D. Mathematics 2012

No description available.