Note on packing patterns in colored permutations
Online Journal of Analytic Combinatorics · 2016
DOI: 10.61091/ojac-1104 ↗Kurz gefasst
Fachartikel in der Zeitschrift Online Journal of Analytic Combinatorics, 2016. Verfasst von Matthew Just und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Packing patterns in permutations concerns finding the permutation with the maximum number of a prescribed pattern. 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) patterns up to length 4 can be obtained. In this note 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.
Zitieren
APA
Just, M., & Wang, H. (2016). Note on packing patterns in colored permutations. Online Journal of Analytic Combinatorics. https://doi.org/10.61091/ojac-1104
Vancouver
Just M, Wang H. Note on packing patterns in colored permutations. Online Journal of Analytic Combinatorics. 2016. doi:10.61091/ojac-1104
BibTeX
@article{Just2016,
author = {Just, Matthew and Wang, Hua},
title = {Note on packing patterns in colored permutations},
journal = {Online Journal of Analytic Combinatorics},
year = {2016},
doi = {10.61091/ojac-1104}
}
EUVIMED