The following pages link to Postorder Preimages (Q2965992):
Displaying 23 items.
- Stack-sorting, set partitions, and Lassalle's sequence (Q778710) (← links)
- Preimages under the Queuesort algorithm (Q1981689) (← links)
- Further bijections to pattern-avoiding valid hook configurations (Q2020016) (← links)
- Troupes, cumulants, and stack-sorting (Q2118918) (← links)
- Catalan intervals and uniquely sorted permutations (Q2174949) (← links)
- Supertrees (Q2181994) (← links)
- Polyurethane toggles (Q2188837) (← links)
- Stack-sorting preimages of permutation classes (Q2199801) (← links)
- Uniquely sorted permutations (Q2199834) (← links)
- Quantifying noninvertibility in discrete dynamical systems (Q2200430) (← links)
- Fertility monotonicity and average complexity of the stack-sorting map (Q2225458) (← links)
- Stack sorting with increasing and decreasing stacks (Q2288161) (← links)
- Counting 3-stack-sortable permutations (Q2299650) (← links)
- Preimages under the stack-sorting algorithm (Q2361080) (← links)
- Lattice paths and \((n - 2)\)-stack sortable permutations (Q2672927) (← links)
- Stack-sorting for Words (Q3300688) (← links)
- Sorting Cayley permutations with pattern-avoiding machines (Q5000313) (← links)
- Stack-sorting for Coxeter groups (Q5052175) (← links)
- 312-Avoiding reduced valid hook configurations and duck words (Q5056197) (← links)
- Enumeration of Stack-Sorting Preimages via a Decomposition Lemma (Q5074765) (← links)
- Fertility, Strong Fertility, and Postorder Wilf Equivalence (Q5109059) (← links)
- Fertilitopes (Q6050220) (← links)
- Characterization and enumeration of preimages under the \texttt{Queuesort} algorithm (Q6604701) (← links)
