Pattern Avoidance in Poset Permutations
Name
11083_2015_9367_ReferencePDF.pdf
Size
653.84 KB
Format
Adobe PDF
Checksum (MD5)
12938aa804ab62a1adda0c14dae1668c
Author(s)
Hopkins, Samuel Francis
Weiler, Morgan
Date Issued
August 2015
Journal
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
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 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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s11083-015-9367-7
