The topology of the permutation pattern poset - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2014

The topology of the permutation pattern poset

Résumé

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.
Fichier principal
Vignette du fichier
dmAT0123.pdf (270.29 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01207609 , version 1 (01-10-2015)

Identifiants

Citer

Peter R. W. Mcnamara, Einar Steingrimsson. 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, ⟨10.46298/dmtcs.2397⟩. ⟨hal-01207609⟩

Collections

TDS-MACS
75 Consultations
817 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More