Permutations with forbidden subsequences and a generalized Schröder number

DOI10.1016/S0012-365X(99)00302-7zbMath0949.05003OpenAlexW2056117952MaRDI QIDQ1978151

Darla Kremer

Publication date: 3 December 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00302-7

zbMATH Keywords

generating treesCatalan numberspolyominoesSchröder numberspattern avoiding permutationsforbidden subsequences

Mathematics Subject Classification ID

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

Related Items (37)

A family of Bell transformations ⋮ The enumeration of permutations avoiding 3124 and 4312 ⋮ Restricted permutations and queue jumping ⋮ Schubert polynomials as projections of Minkowski sums of Gelfand-Tsetlin polytopes ⋮ Upper bounds of Schubert polynomials ⋮ Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations ⋮ Restricted colored permutations and Chebyshev polynomials ⋮ Generalized Schröder permutations ⋮ Partial permutations avoiding pairs of patterns ⋮ 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 ⋮ A sextuple equidistribution arising in pattern avoidance ⋮ Finite transition matrices for permutations avoiding pairs of length four patterns ⋮ Stack-sortable permutations and beyond ⋮ Postscript: ``Permutations with forbidden subsequences and a generalized Schröder number [Discrete Mathematics 218 (2000) 121--130] ⋮ Stack-sorting preimages of permutation classes ⋮ Catalan pairs: a relational-theoretic approach to Catalan numbers ⋮ Counting \(\mathbf {(3+1)}\)-avoiding permutations ⋮ Passing through a stack k times ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ Finitely labeled generating trees and restricted permutations ⋮ Refined restricted inversion sequences ⋮ Generating permutations with restricted containers ⋮ Restricted 132-avoiding permutations ⋮ Restricted signed permutations counted by the Schröder numbers ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ Permutations restricted by two distinct patterns of length three ⋮ Enumeration Schemes for Restricted Permutations ⋮ Bijections on pattern avoiding inversion sequences and related objects ⋮ Stack sorting with increasing and decreasing stacks ⋮ Counting 3-stack-sortable permutations ⋮ Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations ⋮ Passing through a stack \(k\) times with reversals ⋮ Cyclic pattern containment and avoidance ⋮ Symmetric Schröder paths and restricted involutions ⋮ Simple permutations and pattern restricted permutations ⋮ Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials

This page was built for publication: Permutations with forbidden subsequences and a generalized Schröder number