Pattern avoidance in forests of binary shrubs
We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary shrub forests. In this context, we enumerate forests avoidin...
Saved in:
Published in | Discrete Mathematics and Theoretical Computer Science Vol. 18; no. 2; p. F1 |
---|---|
Main Authors | , , , , , , |
Format | Journal Article |
Language | English |
Published |
Nancy
DMTCS
01.06.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!