The following pages link to Sorting twice through a stack (Q688711):
Displayed 12 items.
- Sorting with networks of data structures (Q602673) (← links)
- A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!) (Q1193435) (← links)
- A combinatorial proof of J. West's conjecture (Q1584296) (← links)
- Symmetry and unimodality in \(t\)-stack sortable permutations (Q1601431) (← links)
- Sorting with two ordered stacks in series. (Q1853525) (← links)
- 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers (Q1887043) (← links)
- Permutations with forbidden subsequences and nonseparable planar maps (Q1917517) (← links)
- Stack words, standard tableaux and Baxter permutations (Q1924361) (← links)
- Simple permutations and algebraic generating functions (Q2426423) (← links)
- New equivalences for pattern avoiding involutions (Q3604996) (← links)
- Baxter permutations (Q5906883) (← links)
- Permutations restricted by two distinct patterns of length three (Q5956781) (← links)