Term of Award
Master of Science in Mathematics (M.S.)
Document Type and Release Option
Thesis (open access)
Copyright Statement / License for Reuse
This work is licensed under a Creative Commons Attribution 4.0 License.
Department of Mathematical Sciences
Committee Member 1
Committee Member 2
Pattern containment in permutations, as opposed to pattern avoidance, involves two aspects. The first is to contain every pattern at least once from a given set, known as finding superpatterns; while the second is to contain some given pattern as many times as possible, known as pattern packing. In this thesis, we explore these two questions in circular permutations and present some interesting observations. We also raise some questions and propose some directions for future study.
Lanning, Charles, "Pattern Containment in Circular Permutations" (2017). Electronic Theses & Dissertations. 1649.
Research Data and Supplementary Material