Packing Patterns into Words

  • Alexander Burstein
  • Peter Hästö
  • Toufik Mansour
DOI: https://doi.org/10.37236/1692

Abstract

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.

Published
2003-11-20
How to Cite
Burstein, A., Hästö, P., & Mansour, T. (2003). Packing Patterns into Words. The Electronic Journal of Combinatorics, 9(2), R20. https://doi.org/10.37236/1692
Issue
Volume 9, Issue 2 (2002-3) (Permutation Patterns)
Article Number
R20