Permutations with forbidden subsequences and nonseparable planar maps
From MaRDI portal
Publication:1917517
DOI10.1016/0012-365X(95)00130-OzbMath0853.05047MaRDI QIDQ1917517
Julian West, Sophie Gire, Dulucq, Serge
Publication date: 9 December 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Parallel algorithms in computer science (68W10) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Preimages under the stack-sorting algorithm, Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps, Permutations avoiding certain patterns: The case of length 4 and some generalizations, Sorting with networks of data structures, Generating trees and forbidden subsequences, Lattice paths and \((n - 2)\)-stack sortable permutations, Polyurethane toggles, Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry, The skew Brownian permuton: A new universality class for random constrained permutations, A trinity of duality: non-separable planar maps, \(\beta(1,0)\)-trees and synchronized intervals, Stack-sorting preimages of permutation classes, Restricted non-separable planar maps and some pattern avoiding permutations, On extremal permutations avoiding \(\omega_N=NN-1\dots 1\), Finitely labeled generating trees and restricted permutations, Enumeration of Stack-Sorting Preimages via a Decomposition Lemma, Baxter permutations and plane bipolar orientations, A geometric form for the extended patience sorting algorithm, Fertility, Strong Fertility, and Postorder Wilf Equivalence, ECO:a methodology for the enumeration of combinatorial objects, Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations, Counting 3-stack-sortable permutations, A combinatorial proof of J. West's conjecture, Combinatorial generation via permutation languages. I. Fundamentals, A simplicial complex of 2-stack sortable permutations, Stack-sorting for Words, Troupes, cumulants, and stack-sorting
Cites Work
- Sorting twice through a stack
- 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)\)!)
- Counting rooted maps by genus. III: Nonseparable maps
- Forbidden subsequences
- A combinatorial proof of J. West's conjecture
- The enumeration of Hamiltonian polygons in triangular maps
- Counting rooted maps by genus. I
- Planar Maps are Well Labeled Trees
- A Census of Planar Maps
- Enumeration of Non-Separable Planar Maps
- On the Enumeration of Rooted Non-Separable Planar Maps
- Restricted permutations
- Unnamed Item
- Unnamed Item
- Unnamed Item
