Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 111-137 |
| Number of pages | 27 |
| Journal | Journal of Combinatorics |
| Volume | 2 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2011 |