Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations

DOI10.1006/jcta.1996.0074zbMath0864.05044OpenAlexW2032192467MaRDI QIDQ1924222

Yanyan Li

Publication date: 24 November 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3dacc12bcc1fd4e23cd313e3a5351a670ae1003c

zbMATH Keywords

permutationlattice pathsnon-separable mapsRaney pathstwo-stack-sortable strings

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (28)

Preimages under the stack-sorting algorithm ⋮ Stack-sorting for Coxeter groups ⋮ Fighting fish and two-stack sortable permutations ⋮ Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps ⋮ Sorting with networks of data structures ⋮ Lattice paths and \((n - 2)\)-stack sortable permutations ⋮ Polyurethane toggles ⋮ Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry ⋮ Stack-sorting preimages of permutation classes ⋮ A bijection between Tamari intervals and extended fighting fish ⋮ Restricted non-separable planar maps and some pattern avoiding permutations ⋮ Asymptotic normality in t-stack sortable permutations ⋮ Enumeration of Stack-Sorting Preimages via a Decomposition Lemma ⋮ Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ Stack-sorting with consecutive-pattern-avoiding stacks ⋮ 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 ⋮ Meeting covered elements in \(\nu\)-Tamari lattices ⋮ Stack words and a bound for 3-stack sortable permutations ⋮ Left ternary trees and non-separable rooted planar maps ⋮ A combinatorial proof of J. West's conjecture ⋮ Sorting with two ordered stacks in series. ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ Stack-sorting for Words ⋮ Troupes, cumulants, and stack-sorting

This page was built for publication: Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations