MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Pattern Avoidance in Poset Permutations

Author(s)
Hopkins, Samuel Francis; Weiler, Morgan
Thumbnail
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
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.
Metadata
Show full item record
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.
Date issued
2015-08
URI
http://hdl.handle.net/1721.1/103772
Department
Massachusetts Institute of Technology. Department of Mathematics
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
ISSN
0167-8094
1572-9273

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.