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)\)!)
From MaRDI portal
Publication:1193435
DOI10.1016/0012-365X(92)90351-FzbMath0754.05006WikidataQ122942383 ScholiaQ122942383MaRDI QIDQ1193435
Publication date: 27 September 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Preimages under the stack-sorting algorithm, 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers, Stack-sorting for Coxeter groups, Fighting fish and two-stack sortable permutations, Sorting by shuffling methods and a queue, Permutations with forbidden subsequences and nonseparable planar maps, Sorting with networks of data structures, Stack words, standard tableaux and Baxter permutations, Highly sorted permutations and Bell numbers, Lattice paths and \((n - 2)\)-stack sortable permutations, Fast Algorithms for Discrete Differential Equations, Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry, A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate, Staircases, dominoes, and the growth rate of 1324-avoiders, Stack-sortable permutations and beyond, Highly sorted permutations with respect to a 312-avoiding stack, Bijections between fighting fish, planar maps, and Tamari intervals, Fighting fish, Vincular pattern avoidance on cyclic permutations, A lift of West's stack-sorting map to partition diagrams, A bijection between Tamari intervals and extended fighting fish, Restricted non-separable planar maps and some pattern avoiding permutations, Operators of equivalent sorting power and related Wilf-equivalences, Fertility monotonicity and average complexity of the stack-sorting map, Asymptotic normality in t-stack sortable permutations, Enumeration of Stack-Sorting Preimages via a Decomposition Lemma, Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations, Fighting fish: enumerative properties, Sorting twice through a stack, Baxter permutations and plane bipolar orientations, Further bijections to pattern-avoiding valid hook configurations, Polynomial equations with one catalytic variable, algebraic series and map enumeration, Asymptotics of 3-stack-sortable permutations, Stack-sorting with consecutive-pattern-avoiding stacks, Enumerating permutations sortable by \(k\) passes through a pop-stack, Enumerating permutations sortable by \(k\) passes through a pop-stack, Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations, Counting 3-stack-sortable permutations, A bijective census of nonseparable planar maps, Meeting covered elements in \(\nu\)-Tamari lattices, Stack words and a bound for 3-stack sortable permutations, Stack-sorting, set partitions, and Lassalle's sequence, A combinatorial proof of J. West's conjecture, Sorting with two ordered stacks in series., Combinatorial generation via permutation languages. I. Fundamentals, Symmetry and unimodality in \(t\)-stack sortable permutations, Two-stack-sorting with pop stacks, A simplicial complex of 2-stack sortable permutations, Troupes, cumulants, and stack-sorting
Uses Software
Cites Work
