Stack-sorting preimages of permutation classes

From MaRDI portal
Publication:2199801

zbMATH Open1447.05004arXiv1809.03123MaRDI QIDQ2199801FDOQ2199801

Colin Defant

Publication date: 14 September 2020

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Abstract: We extend and generalize many of the enumerative results concerning West's stack-sorting map s. First, we prove a useful theorem that allows one to efficiently compute |s1(pi)| for any permutation pi, answering a question of Bousquet-M'elou. We then enumerate permutations in various sets of the form s1(extAv(au(1),ldots,au(r))), where extAv(au(1),ldots,au(r)) is the set of permutations avoiding the patterns au(1),ldots,au(r). These preimage sets often turn out to be permutation classes themselves, so the current paper represents a new approach, based on the theory of valid hook configurations, for solving classical enumerative problems. In one case, we solve a problem previously posed by Bruner. We are often able to refine our counts by enumerating these permutations according to their number of descents or peaks. Our investigation not only provides several new combinatorial interpretations and identities involving known sequences, but also paves the way for several new enumerative problems.


Full work available at URL: https://arxiv.org/abs/1809.03123

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (12)

Uses Software





This page was built for publication: Stack-sorting preimages of permutation classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199801)