Complete words and superpatterns
Document
Item Description
Linked Agent
Creator (cre): Biers-Ariel, Yonah
Advisor (adv): Guichard, David
Department (dpt): Whitman College. Mathematics Department
Date
May 13, 2015
Graduation Year
2015
Abstract
This thesis surveys the most important results regarding complete words, by which we mean words containing as subsequences every permutation of some set, and then considers two variants of the problem of finding the shortest complete words. The first of these asks for the shortest superpattern, which is a complete word with some additional requirements, and the second asks for the expected number of timesteps before a particular random process generates a complete word.
Subject
Genre
Extent
30 pages
Permanent URL
Contact Us
If you have questions about permitted uses of this content, please contact the Arminda administrator: http://works.whitman.edu/contact-arminda