Skip to Main content Skip to Navigation
Conference papers

The topology of the permutation pattern poset

Abstract : The set of all permutations, ordered by pattern containment, forms a poset. This extended abstract 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.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01207609
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, October 1, 2015 - 9:29:13 AM
Last modification on : Wednesday, November 25, 2020 - 5:10:02 PM
Long-term archiving on: : Saturday, January 2, 2016 - 10:44:21 AM

File

dmAT0123.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01207609, version 1

Collections

Citation

Peter Mcnamara, Einar Steingrımsson. The topology of the permutation pattern poset. 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), 2014, Chicago, United States. pp.253-264. ⟨hal-01207609⟩

Share

Metrics

Record views

196

Files downloads

1114