### Abstract

Language | English |
---|---|

Pages | 1-35 |

Number of pages | 35 |

Journal | Journal of Combinatorial Theory Series A |

Volume | 134 |

Early online date | 20 Mar 2015 |

DOIs | |

Publication status | Published - 31 Aug 2015 |

### Fingerprint

### Keywords

- pattern poset
- shellable
- disconnected
- layered permutations
- generalized subword order
- Möbius function

### Cite this

*Journal of Combinatorial Theory Series A*,

*134*, 1-35. https://doi.org/10.1016/j.jcta.2015.02.009

}

*Journal of Combinatorial Theory Series A*, vol. 134, pp. 1-35. https://doi.org/10.1016/j.jcta.2015.02.009

**On the topology of the permutation pattern poset.** / McNamara, Peter R. W.; Steingrímsson, Einar.

Research output: Contribution to journal › Article

TY - JOUR

T1 - On the topology of the permutation pattern poset

AU - McNamara, Peter R. W.

AU - Steingrímsson, Einar

PY - 2015/8/31

Y1 - 2015/8/31

N2 - The set of all permutations, ordered by pattern containment, forms a poset. This paper presents the first explicit major results on the topology of intervals in this poset. We show that almost all (open) intervals in this poset have a disconnected subinterval and are thus not shellable. Nevertheless, there seem to be large classes of intervals that are shellable and thus have the homotopy type of a wedge of spheres. We prove this to be the case for all intervals of layered permutations that have no disconnected subintervals of rank 3 or more. We also characterize in a simple way those intervals of layered permutations that are disconnected. These results carry over to the poset of generalized subword order when the ordering on the underlying alphabet is a rooted forest. We conjecture that the same applies to intervals of separable permutations, that is, that such an interval is shellable if and only if it has no disconnected subinterval of rank 3 or more. We also present a simplified version of the recursive formula for the Möbius function of decomposable permutations given by Burstein et al. [9].

AB - The set of all permutations, ordered by pattern containment, forms a poset. This paper presents the first explicit major results on the topology of intervals in this poset. We show that almost all (open) intervals in this poset have a disconnected subinterval and are thus not shellable. Nevertheless, there seem to be large classes of intervals that are shellable and thus have the homotopy type of a wedge of spheres. We prove this to be the case for all intervals of layered permutations that have no disconnected subintervals of rank 3 or more. We also characterize in a simple way those intervals of layered permutations that are disconnected. These results carry over to the poset of generalized subword order when the ordering on the underlying alphabet is a rooted forest. We conjecture that the same applies to intervals of separable permutations, that is, that such an interval is shellable if and only if it has no disconnected subinterval of rank 3 or more. We also present a simplified version of the recursive formula for the Möbius function of decomposable permutations given by Burstein et al. [9].

KW - pattern poset

KW - shellable

KW - disconnected

KW - layered permutations

KW - generalized subword order

KW - Möbius function

UR - http://www.sciencedirect.com/science/article/pii/S009731651500028X

UR - http://www.sciencedirect.com/science/journal/00973165

U2 - 10.1016/j.jcta.2015.02.009

DO - 10.1016/j.jcta.2015.02.009

M3 - Article

VL - 134

SP - 1

EP - 35

JO - Journal of Combinatorial Theory Series A

T2 - Journal of Combinatorial Theory Series A

JF - Journal of Combinatorial Theory Series A

SN - 0097-3165

ER -