scientific article; zbMATH DE number 1447312
From MaRDI portal
Publication:4954008
Recommendations
Cited in
(23)- Symmetric Schröder paths and restricted involutions
- Forbidden subsequences
- Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three
- Regular closed sets of permutations.
- Generating trees and the Catalan and Schröder numbers
- The number of permutations containing exactly one increasing subsequence of length three
- Classification of forbidden subsequences of length 4
- On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation
- Permutations avoiding sets of patterns with long monotone subsequences
- Subregularity in infinitely labeled generating trees of restricted permutations
- On partially ordered patterns of length 4 and 5 in permutations
- Finitely labeled generating trees and restricted permutations
- Restricted signed permutations counted by the Schröder numbers
- In memoriam: Alberto Del Lungo (1965--2003)
- Permutations avoiding runs of i, i+1, i+2 or i, i-1, i-2
- Generalized Schröder permutations
- Some permutations with forbidden subsequences and their inversion number
- Permutations of a multiset avoiding permutations of length 3
- Permutations restricted by two distinct patterns of length three
- scientific article; zbMATH DE number 7732121 (Why is no real title available?)
- Pattern avoidance and Schur-positivity in restricted-growth words of type B
- The enumeration of permutations whose posets have a maximum element
- Combinatorial Gray codes for classes of pattern avoiding permutations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4954008)