A combinatorial proof of J. West's conjecture
From MaRDI portal
Publication:1584296
DOI10.1016/S0012-365X(98)80005-8zbMath0957.05007OpenAlexW2005936038WikidataQ123202616 ScholiaQ123202616MaRDI QIDQ1584296
Olivier Guibert, Dulucq, Serge, Sophie Gire
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)80005-8
Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30)
Related Items
Preimages under the stack-sorting algorithm, 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers, Fighting fish and two-stack sortable permutations, Permutations with forbidden subsequences and nonseparable planar maps, Sorting with networks of data structures, Stack words, standard tableaux and Baxter permutations, Polyurethane toggles, Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry, Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels, Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture, Stack-sorting preimages of permutation classes, Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations, Restricted non-separable planar maps and some pattern avoiding permutations, Finitely labeled generating trees and restricted permutations, Enumeration of Stack-Sorting Preimages via a Decomposition Lemma, Unnamed Item, A geometric form for the extended patience sorting algorithm, Fertility, Strong Fertility, and Postorder Wilf Equivalence, Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations, Counting 3-stack-sortable permutations, On linear transformations preserving the Pólya frequency property, A bijective census of nonseparable planar maps, Combinatorial generation via permutation languages. I. Fundamentals, Symmetry and unimodality in \(t\)-stack sortable permutations, Troupes, cumulants, and stack-sorting
Cites Work
- Unnamed Item
- Unnamed Item
- Non-commutative rational power series and algebraic generating functions
- Sorting twice through a stack
- Stack sortable permutations
- 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)\)!)
- The number of Baxter permutations
- Some combinatorial properties of Schubert polynomials
- Forbidden subsequences
- Asymptotic values for degrees associated with strips of Young diagrams
- Generating trees and the Catalan and Schröder numbers
- Permutations with forbidden subsequences and nonseparable planar maps
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Generating trees and forbidden subsequences
- Planar Maps are Well Labeled Trees
- On the enumeration of planar maps
- A Census of Planar Maps
- Enumeration of Non-Separable Planar Maps
- On the Enumeration of Rooted Non-Separable Planar Maps
- Restricted permutations
