Permutations with forbidden subsequences and a generalized Schröder number
From MaRDI portal
(Redirected from Publication:1978151)
Recommendations
Cited in
(47)- Partial permutations avoiding pairs of patterns
- Permutations restricted by two distinct patterns of length three
- Counting \(\mathbf {(3+1)}\)-avoiding permutations
- Passing through a stack \(k\) times with reversals
- Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations
- Counting 3-stack-sortable permutations
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Two stacks in series: a decreasing stack followed by an increasing stack
- Matrix Schubert varieties, binomial ideals, and reduced Gröbner bases
- Restricted 132-avoiding permutations
- Generating permutations with restricted containers
- The enumeration of permutations avoiding 3124 and 4312
- Upper bounds of Schubert polynomials
- A family of Bell transformations
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Generalized Schröder permutations
- Postscript: ``Permutations with forbidden subsequences and a generalized Schröder number [Discrete Mathematics 218 (2000) 121--130]
- Finite transition matrices for permutations avoiding pairs of length four patterns
- A sextuple equidistribution arising in pattern avoidance
- Separable elements and splittings in Weyl groups of type B
- Restricted permutations and queue jumping
- Catalan pairs: a relational-theoretic approach to Catalan numbers
- Stack sorting with increasing and decreasing stacks
- Passing through a stack k times
- Bijections on pattern avoiding inversion sequences and related objects
- Permutations, parenthesis words, and Schröder numbers
- Generating trees and the Catalan and Schröder numbers
- Restricted signed permutations counted by the Schröder numbers
- Simple permutations and pattern restricted permutations
- Combinatorial exploration: an algorithmic framework for enumeration
- Stack-sortable permutations and beyond
- Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
- Finitely labeled generating trees and restricted permutations
- Schubert polynomials as projections of Minkowski sums of Gelfand-Tsetlin polytopes
- Enumeration Schemes for Restricted Permutations
- Three classes of inversion sequences counted by large Schröder numbers
- Symmetric Schröder paths and restricted involutions
- Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
- Signed Mahonian identities on permutations with subsequence restrictions
- scientific article; zbMATH DE number 1103087 (Why is no real title available?)
- Cyclic pattern containment and avoidance
- Stack-sorting preimages of permutation classes
- Combinatorial Gray codes for classes of pattern avoiding permutations
- More restrictive Gray codes for some classes of pattern avoiding permutations
- Restricted colored permutations and Chebyshev polynomials
- On a conjecture of Lin and Kim concerning a refinement of Schröder numbers
- scientific article; zbMATH DE number 1447312 (Why is no real title available?)
This page was built for publication: Permutations with forbidden subsequences and a generalized Schröder number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978151)
