Packing patterns into words
The electronic journal of combinatorics, Permutation Patterns, Tome 9 (2002) no. 2
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl arXiv
In this article we generalize packing density problems from permutations to patterns with repeated letters and generalized patterns. We are able to find the packing density for some classes of patterns and several other short patterns.
Alexander Burstein; Peter Hästö; Toufik Mansour. Packing patterns into words. The electronic journal of combinatorics, Permutation Patterns, Tome 9 (2002) no. 2. doi: 10.37236/1692
@article{10_37236_1692,
author = {Alexander Burstein and Peter H\"ast\"o and Toufik Mansour},
title = {Packing patterns into words},
journal = {The electronic journal of combinatorics},
year = {2002},
volume = {9},
number = {2},
doi = {10.37236/1692},
zbl = {1031.05007},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1692/}
}
Cité par Sources :