Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
type: Item
instance of: scholarly article
title: Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
zbMATH Open document ID: 1503.05009
author: Matteo Cervetti
author: L. Ferrari
published in: Annals of Combinatorics
publication date: 2022-11-07T00:00:00Z
Mathematics Subject Classification ID: 05A18
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 06A07
zbMATH DE Number: 7612874
zbMATH Keywords: arc diagram representation
zbMATH Keywords: shape-Wilf-equivalence
zbMATH Keywords: Dyck paths
describes a project that uses: OEIS
describes a project that uses: BinaryTrees
MaRDI profile type: Publication
full work available at URL: s00026-022-00596-1
OpenAlex ID: W4294571944
cites work: A general theory of Wilf-equivalence for Catalan structures
cites work: Tree pattern query minimization
cites work: Permutation classes and polyomino classes with excluded submatrices
cites work: The Dyck pattern poset
cites work: Enumerative combinatorics of intervals in the Dyck pattern poset
cites work: Pattern avoidance in matchings and partitions
cites work: The Möbius function of separable and decomposable permutations
cites work: Q4483919
cites work: Two bijections on Tamari intervals
cites work: Crossings and nestings of matchings and partitions
cites work: Enumerative results on the Schröder pattern poset
cites work: Non-contiguous pattern avoidance in binary trees
cites work: Catalan pairs: a relational-theoretic approach to Catalan numbers
cites work: Pattern avoidance in labelled trees
cites work: Planar triangulations, bridgeless planar maps and Tamari intervals
cites work: Enumeration of edges in some lattices of paths
cites work: Enumeration of chains and saturated chains in Dyck lattices.
cites work: Q3549563
cites work: Pattern Avoidance in Ternary Trees
cites work: Counting embeddings of rooted trees into families of rooted trees
cites work: Standard Young tableaux of height 4 and 5
cites work: Dyck paths and pattern-avoiding matchings
cites work: Matchings and partial patterns
cites work: Q5585020
cites work: An asymptotic ratio in the complete binary tree
cites work: On the foundations of combinatorial theory I. Theory of M�bius Functions
cites work: Pattern avoidance in binary trees
cites work: Q3094527
cites work: The On-Line Encyclopedia of Integer Sequences
cites work: On the Möbius function and topology of general pattern posets
cites work: Intervals and factors in the Bruhat order
DOI: 10.1007/S00026-022-00596-1
description: scientific article; zbMATH DE number 7612874