Pattern Avoidance in Poset Permutations
Download11083_2015_9367_ReferencePDF.pdf (653.8Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
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 (123) for any poset P, and we exactly classify the posets for which equality holds.
Date issued
2015-08Department
Massachusetts Institute of Technology. Department of MathematicsJournal
Order
Publisher
Springer Netherlands
Citation
Hopkins, Sam, and Morgan Weiler. “Pattern Avoidance in Poset Permutations.” Order 33, no. 2 (August 13, 2015): 299–310.
Version: Author's final manuscript
ISSN
0167-8094
1572-9273