Pattern Avoidance in Poset Permutations

Abstract

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 $\pi$ is denoted $Av_P(\pi)$. We extend a proof of Simion and Schmidt to show that $Av_P(132) \leq Av_P(123)$ for any poset $P$, and we exactly classify the posets for which equality holds.Comment: 13 pages, 1 figure; v2: corrected typos; v3: corrected typos and improved formatting; v4: to appear in Order; v5: corrected typos; v6: updated author email addresse