Multi-static enumeration of two-stack sortable permutations
From MaRDI portal
Publication:1383515
zbMath0890.05004MaRDI QIDQ1383515
Publication date: 22 April 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119439
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)
Related Items (20)
132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers ⋮ Fighting fish and two-stack sortable permutations ⋮ Sorting with networks of data structures ⋮ Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry ⋮ Vincular pattern avoidance on cyclic permutations ⋮ Stack-sorting preimages of permutation classes ⋮ 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 ⋮ Further bijections to pattern-avoiding valid hook configurations ⋮ Polynomial equations with one catalytic variable, algebraic series and map enumeration ⋮ New equivalences for pattern avoiding involutions ⋮ 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 ⋮ Description trees and Tutte formulas. ⋮ A simplicial complex of 2-stack sortable permutations ⋮ Troupes, cumulants, and stack-sorting
This page was built for publication: Multi-static enumeration of two-stack sortable permutations
