Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
We give three applications of a recently-proven "Decomposition Lemma," which allows one to count preimages of certain sets of permutations under West's stack-sorting map $s$. We first enumerate the permutation class $s^{-1}(\text{Av}(231,321))=\text{Av}(2341,3241,45231)$, finding a ne...
Main Author: | Colin Defant |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2021-04-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/6709/pdf |
Similar Items
-
Postorder Preimages
by: Colin Defant
Published: (2017-02-01) -
Enumerating two permutation classes by the number of cycles
by: Kassie Archer
Published: (2022-10-01) -
Proofs of Conjectures about Pattern-Avoiding Linear Extensions
by: Colin Defant
Published: (2019-10-01) -
Enumeration of Dumont permutations avoiding certain four-letter patterns
by: Alexander Burstein, et al.
Published: (2021-07-01) -
Flip-sort and combinatorial aspects of pop-stack sorting
by: Andrei Asinowski, et al.
Published: (2021-04-01)