Postscript: ``Permutations with forbidden subsequences and a generalized Schröder number [Discrete Mathematics 218 (2000) 121--130]

DOI10.1016/S0012-365X(03)00124-9zbMath1025.05001MaRDI QIDQ1406568

Darla Kremer

Publication date: 4 September 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (11)

The enumeration of permutations avoiding 3124 and 4312 ⋮ Generalized Schröder permutations ⋮ Two stacks in series: a decreasing stack followed by an increasing stack ⋮ Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels ⋮ Counting \(\mathbf {(3+1)}\)-avoiding permutations ⋮ Passing through a stack k times ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ Generating permutations with restricted containers ⋮ Counting 3-stack-sortable permutations ⋮ On partially ordered patterns of length 4 and 5 in permutations ⋮ Passing through a stack \(k\) times with reversals

Cites Work

• Permutations with forbidden subsequences and a generalized Schröder number

This page was built for publication: Postscript: ``Permutations with forbidden subsequences and a generalized Schröder number [Discrete Mathematics 218 (2000) 121--130]