Abstract
A partially ordered (generalized) pattern (POP) is a generalized pattern some of whose letters are incomparable. In this paper, we study avoidance of POPs in compositions and generalize results for avoidance of POPs in permutations and words. Specifically, we obtain results for the generating functions for the number of compositions that avoid shuffle patterns and multi-patterns. In addition, we give the generating function for the distribution of the maximum number of non-overlapping occurrences of a segmented POP t among the compositions of n, provided we know the generating function for the number of compositions of n that avoid t.
| Original language | English |
|---|---|
| Pages (from-to) | 123–134 |
| Number of pages | 12 |
| Journal | Pure Mathematics and Applications |
| Volume | 17 |
| Issue number | 1-2 |
| Publication status | Published - 2007 |
Keywords
- compositions
- partially ordered generalized patterns
- non-over-lapping occurrences
- generating functions
Fingerprint Dive into the research topics of 'Avoidance of partially ordered patterns in compositions'. Together they form a unique fingerprint.
Cite this
Heubach, S., Kitaev, S., & Mansour, T. (2007). Avoidance of partially ordered patterns in compositions. Pure Mathematics and Applications, 17(1-2), 123–134.