Postorder Preimages
From MaRDI portal
Publication:2965992
zbMath1397.05010arXiv1604.01723MaRDI QIDQ2965992
Publication date: 3 March 2017
Full work available at URL: https://arxiv.org/abs/1604.01723
Related Items (22)
Preimages under the stack-sorting algorithm ⋮ Stack-sorting for Coxeter groups ⋮ 312-Avoiding reduced valid hook configurations and duck words ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ Catalan intervals and uniquely sorted permutations ⋮ Supertrees ⋮ Lattice paths and \((n - 2)\)-stack sortable permutations ⋮ Fertilitopes ⋮ Polyurethane toggles ⋮ Stack-sorting preimages of permutation classes ⋮ Uniquely sorted permutations ⋮ Quantifying noninvertibility in discrete dynamical systems ⋮ Fertility monotonicity and average complexity of the stack-sorting map ⋮ Preimages under the Queuesort algorithm ⋮ Enumeration of Stack-Sorting Preimages via a Decomposition Lemma ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ Further bijections to pattern-avoiding valid hook configurations ⋮ Stack sorting with increasing and decreasing stacks ⋮ Counting 3-stack-sortable permutations ⋮ Stack-sorting, set partitions, and Lassalle's sequence ⋮ Stack-sorting for Words ⋮ Troupes, cumulants, and stack-sorting
This page was built for publication: Postorder Preimages
