A Wilf equivalence related to two stack sortable permutations

Simple item page
dc.creatorCallan, David
dc.date2005-10-11
dc.date.accessioned2026-07-07T06:47:20Z
dc.date.available2026-07-07T06:47:20Z
dc.descriptionA permutation is so-called two stack sortable if it (i) avoids the (scattered) pattern 2-3-4-1, and (ii) contains a 3-2-4-1 pattern only as part of a 3-5-2-4-1 pattern. Here we show that the permutations on [n] satisfying condition (ii) alone are equinumerous with the permutations on [n] that avoid the mixed scattered/consecutive pattern 31-4-2. The proof uses a known bijection from 3-2-1-avoiding to 3-1-2-avoiding permutations.
dc.descriptionLaTeX, 4 pages
dc.identifierhttps://arxiv.org/abs/math/0510211
dc.identifierhttp://arxiv.org/abs/math/0510211
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/103620
dc.subjectCombinatorics
dc.subject05A15
dc.titleA Wilf equivalence related to two stack sortable permutations
dc.typetext

Files

Collections

arXiv