Partitions and partial matchings avoiding neighbor patterns

DOI10.1016/j.ejc.2011.09.039zbMath1236.05016arXiv1009.4535OpenAlexW2059169284MaRDI QIDQ412240

Alina F. Y. Zhao, Neil J. Y. Fan, William Y. C. Chen

Publication date: 4 May 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.4535

zbMATH Keywords

generating functionsleft nestingspartial mathings avoiding neighborhood alignmentsright nestings

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Regular simple queues of protein contact maps ⋮ Equidistributed statistics on matchings and permutations ⋮ An operator on ascent sequences

Uses Software

• OEIS

Cites Work

• Matchings avoiding partial patterns and lattice paths
• Matchings avoiding partial patterns
• Ascent sequences and upper triangular matrices containing non-negative integers
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• On a class of linked diagrams. I: Enumeration
• On trees and noncrossing partitions
• Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
• Reduction of \(m\)-regular noncrossing partitions
• Bell numbers, their relatives, and algebraic differential equations
• On \(abab\)-free and \(abba\)-free set partitions
• The On-Line Encyclopedia of Integer Sequences
• $n!$ matchings, $n!$ posets
• A direct encoding of Stoimenow's matchings as ascent sequences
• Crossings and nestings of matchings and partitions
• ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS

This page was built for publication: Partitions and partial matchings avoiding neighbor patterns