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: | Hopkins, Samuel Francis (Contributor), Weiler, Morgan (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer Netherlands,
2016-07-20T15:29:38Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Permutations statistics of indexed and poset permutations
by: Steingrímsson, Einar
Published: (2007) -
On the Möbius function and topology of the permutation poset
by: Smith, Jason P.
Published: (2015) -
ANALYTIC AND TOPOLOGICAL COMBINATORICS OF PARTITION POSETS AND PERMUTATIONS
by: Jung, JiYoon
Published: (2012) -
Statistics on pattern-avoiding permutations
by: Elizalde, Sergi, 1979-
Published: (2005) -
Alternating, Pattern-Avoiding Permutations
by: Lewis, Joel Brewster
Published: (2014)