Pattern Avoidance in Poset Permutations
We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance in permutations on partially ordered sets. The number of permutations on P that avoid the pattern p is denoted A v P (p). We extend a proof of Simion and Schmidt to show that A v P (132)=A v P (1...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Netherlands,
2016-07-20T15:29:38Z.
|
| Subjects: | |
| Online Access: | Get fulltext |