Author(s)

Yonah Biers-Ariel

Graduation Year

2015

Date of Thesis Acceptance

Spring 5-13-2015

Major Department or Program

Mathematics

Advisor(s)

David Guichard

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.

Page Count

30

Subject Headings

Permutations, Number theory, Combinatorics on words, Combinatorial analysis, Whitman College 2015 -- Dissertation collection -- Mathematics Department

Permanent URL

http://hdl.handle.net/10349/20151078

Document Type

Public Accessible Thesis

Terms of Use

If you have questions about permitted uses of this content, please contact the ARMINDA administrator

Included in

Mathematics Commons

Share

COinS
 

Rights Statement

Rights Statement

In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).