Dyck paths, binary words, and Grassmannian permutations avoiding an increasing pattern
From MaRDI portal
Publication:6621953
DOI10.1007/S00026-023-00667-XMaRDI QIDQ6621953
Publication date: 21 October 2024
Published in: Annals of Combinatorics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-contiguous pattern avoidance in binary trees
- Spherical Schubert varieties and pattern avoidance
- When is a Schubert variety Gorenstein?
- Avoidance of partitions of a three-element set
- Multivariate Fuss-Catalan numbers
- Pattern avoidance in binary trees
- Pattern avoidance in permutations: Linear and cyclic orders
- Rooted forests that avoid sets of permutations
- On \(abab\)-free and \(abba\)-free set partitions
- Classical and consecutive pattern avoidance in rooted forests
- On pattern avoidance in matchings and involutions
- Pattern avoidance of \([4,k\)-pairs in circular permutations]
- On polynomials related to powers of the generating function of Catalan's numbers.
- Catalan Numbers
- Combinatorics of Compositions and Words
- Pattern avoidance and fiber bundle structures on Schubert varieties
- Restricted permutations
- A pattern avoidance characterization for smoothness of positroid varieties
- Restricted Grassmannian permutations
This page was built for publication: Dyck paths, binary words, and Grassmannian permutations avoiding an increasing pattern
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621953)
