Term of Award
Master of Science in Mathematics (M.S.)
Document Type and Release Option
Thesis (open access)
Department of Mathematical Sciences
Committee Member 1
Committee Member 2
Committee Member 3
Packing patterns in words concerns finding a word with the maximum number of a prescribed pattern. The majority of the work done thus far is on packing patterns into permutations. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation containing the maximum number of a layered pattern among all permutations of length n. Consequently, the packing density for all but two (up to equivalence) permutation patterns up to length 4 can be obtained. In this thesis we consider the analogous question for colored patterns and permutations. By introducing the concept of colored blocks we characterize the optimal permutations with the maximum number of a given colored pattern when it contains at most three colored blocks. As examples, we apply this characterization to find the optimal permutations of various colored patterns and subsequently obtain their corresponding packing densities.
Just, Matthew R., "Combinatorial Optimization of Subsequence Patterns in Words" (2016). Electronic Theses & Dissertations. 1464.
Research Data and Supplementary Material