Preimages under a popqueue-sorting algorithm

References

[1] M. H. Albert, M. D. Atkinson, M. Bouvel, A. Claesson and M. Dukes, On the inverse image of pattern classes under bubble sort, J. Comb., 2 (2011) 231–243.10.4310/JOC.2011.v2.n2.a3
Search in Google Scholar Back to article
[2] M. Bousquet-Mélou, Sorted and/or sortable permutations, Discrete Math., 225 (2000) 25–50.10.1016/S0012-365X(00)00146-1
Search in Google Scholar Back to article
[3] M. Bouvel, L. Cioni and L. Ferrari, Preimages under the bubblesort operator, arXiv:2204.12936.
Search in Google Scholar Back to article
[4] L. Cioni and L. Ferrari, Preimages under the Queuesort algorithm, Discrete Math., 344 (2021) 112561.10.1016/j.disc.2021.112561
Search in Google Scholar Back to article
[5] L. Cioni and L. Ferrari, Sorting with a popqueue, in preparation.
Search in Google Scholar Back to article
[6] C. Defant, Postorder preimages, Discrete Math. Theor. Comput. Sci., 19(1) (2017) #3.
Search in Google Scholar Back to article
[7] C. Defant, M. Engen and J. A. Miller, Stack-sorting, set partitions, and Lassalle’s sequence, J. Combin. Theory Ser. A, 175 (2020) 105275.
Search in Google Scholar Back to article
[8] D. Knuth, The Art of Computer Programming, Volume 1, Boston: Addison-Wesley, 1968.
Search in Google Scholar Back to article
[9] J. West, Permutations with forbidden subsequences and Stack sortable permutations, PhD thesis, Massachusetts Institute of Technology, 1990.
Search in Google Scholar Back to article