Mathematical Sciences: Faculty Presentations (1991-2022)
Packing (Colored) Patterns in Permutations
Document Type
Presentation
Presentation Date
12-6-2014
Copyright
This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.
Abstract or Description
It is known that the maximum number of layered patterns is achieved in layered permutations. This general result allows the presentation of such optimal permutations with regard to all patterns of length three and most patterns of length four. When the pattern and permutations are colored, the problem, although still of the same nature, becomes different. We present background information and some preliminary studies on this topic.
Sponsorship/Conference/Institution
Palmetto Number Theory Series (PANTS)
Location
Columbia, SC
Recommended Citation
Wang, Hua.
2014.
"Packing (Colored) Patterns in Permutations."
Mathematical Sciences: Faculty Presentations (1991-2022).
Presentation 529.
https://digitalcommons.georgiasouthern.edu/math-sci-facpres/529
