Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
From MaRDI portal
Publication:2093265
DOI10.1007/s00026-022-00596-1zbMath1503.05009OpenAlexW4294571944MaRDI QIDQ2093265
Publication date: 7 November 2022
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-022-00596-1
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Dyck pattern poset
- Non-contiguous pattern avoidance in binary trees
- Enumeration of chains and saturated chains in Dyck lattices.
- Matchings and partial patterns
- The Möbius function of separable and decomposable permutations
- Pattern avoidance in labelled trees
- Dyck paths and pattern-avoiding matchings
- A general theory of Wilf-equivalence for Catalan structures
- Pattern avoidance in binary trees
- Standard Young tableaux of height 4 and 5
- An asymptotic ratio in the complete binary tree
- Enumerative results on the Schröder pattern poset
- On the Möbius function and topology of general pattern posets
- Planar triangulations, bridgeless planar maps and Tamari intervals
- Tree pattern query minimization
- Pattern avoidance in matchings and partitions
- Catalan pairs: a relational-theoretic approach to Catalan numbers
- Counting embeddings of rooted trees into families of rooted trees
- Enumerative combinatorics of intervals in the Dyck pattern poset
- Permutation classes and polyomino classes with excluded submatrices
- Crossings and nestings of matchings and partitions
- Two bijections on Tamari intervals
- Pattern Avoidance in Ternary Trees
- Enumeration of edges in some lattices of paths
- Intervals and factors in the Bruhat order
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
This page was built for publication: Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
