Back to search

East Tennessee State University

Universal Cycles for Some Combinatorial Objects

Abstract

dc:description.abstract

A de Bruijn cycle commonly referred to as a universal cycle (u-cycle), is a complete and compact listing of a collection of combinatorial objects. In this paper, we show the power of de Bruijn's original theorem, namely that the cycles bearing his name exist for n-letter words on a k-letter alphabet for all values of k,n, to prove that we can create de Bruijn cycles for multi-sets using natural encodings and M-Lipschitz n-letter words and the assignment of elements of [n]={1,2,...,n} to the sets in any labeled subposet of the Boolean lattice; de Bruijn's theorem corresponds to the case when the subposet in question consists of a single ground element. In this paper, we also show that de Bruijn's cycles exist for words with weight between s and t, where these parameters are suitably restricted.

Degree

thesis:*
Name thesis:degree_name
MS (Master of Science)
Level thesis:degree_level
Thesis - unrestricted
Discipline thesis:degree_discipline
Mathematical Sciences
Year dc:date.issued
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Campbell, Andre A

Subjects

dc:subject × 6

Rights

dc:rights
Statement dc:rights
  • Copyright by the authors.

Identifiers

dc:identifier.*
Repository record dc:identifier
https://dc.etsu.edu/etd/1130

Chain of custody

source
Harvested from
East Tennessee State University
Base URL
dc.etsu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Campbell, Andre A. Universal Cycles for Some Combinatorial Objects. Thesis - unrestricted thesis, 2013. https://dc.etsu.edu/etd/1130