Packing a binary pattern in compositions
Journal article, 2011
In this article we generalize packing density problems from permutations and words to compositions. We are able to find the packing density for some classes of subsequence and generalized patterns and all the three letter binary patterns.
Author
Ragnar Freij
Chalmers, Mathematical Sciences
University of Gothenburg
Toufik Mansour
Journal of Combinatorics
2156-3527 (ISSN)
Vol. 2 1 111-138Roots
Basic sciences
Subject Categories
Discrete Mathematics