Distribution of crossings, nestings and alignments of two edges in matchings and partitions

zbMATH Open1096.05006MaRDI QIDQ2500952FDOQ2500952

Authors Anisse Kasraoui, Jiang Zeng

Publication date 30 August 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) (q)-calculus and related topics (05A30)

Abstract: We construct an involution on set partitions which keeps track of the numbers of crossings, nestings and alignments of two edges. We derive then the symmetric distribution of the numbers of crossings and nestings in partitions, which generalizes Klazar's recent result in perfect matchings. By factorizing our involution through bijections between set partitions and some path diagrams we obtain the continued fraction expansions of the corresponding ordinary generating functions.

Recommendations

• Crossings and nestings of matchings and partitions
• Crossings and nestings of two edges in set partitions
• \(k\)-distant crossings and nestings of matchings and partitions
• On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings
• Arc-coloured permutations

Cited in

(40)

• A simple algorithm for expanding a power series as a continued fraction
• A note on statistical averages for oscillating tableaux
• Folded bump diagrams for partitions of classical types
• Central limit theorems for some set partition statistics
• Crossings and alignments of permutations
• Avoiding monotone chains in fillings of layer polyominoes
• Two-parameter non-commutative central limit theorem
• Positive and negative chains in charged moon polyominoes
• Crossings and nestings of two edges in set partitions
• The Matrix Ansatz, orthogonal polynomials, and permutations
• \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams
• On noncrossing and nonnesting partitions of type \(D\)
• Permutations, moments, measures
• Polynomiality of certain average weights for oscillating tableaux
• Ordered unavoidable sub-structures in matchings and random matchings
• Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices
• The combinatorics of associated Hermite polynomials
• \(k\)-distant crossings and nestings of matchings and partitions
• Descents on nonnesting multipermutations
• Chains of length 2 in fillings of layer polyominoes
• Enumeration of bilaterally symmetric 3-noncrossing partitions
• Some multivariate master polynomials for permutations, set partitions, and perfect matchings, and their continued fractions
• Avoidance of partitions of a three-element set
• Proofs of two conjectures of Kenyon and Wilson on Dyck tilings
• The \((q, t)\)-Gaussian process
• On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings
• Ascents and descents in 01-fillings of moon polyominoes
• Major index for 01-fillings of moon polyominoes
• A major index for matchings and set partitions
• A bijection between partially directed paths in the symmetric wedge and matchings
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Symmetric partitions and pairings
• Crossings, Motzkin paths and moments
• $n!$ matchings, $n!$ posets
• Fillings of skew shapes avoiding diagonal patterns
• A geometric interpretation of the intertwining number
• Higher-order matching polynomials and \(d\)-orthogonality
• Patterns in ordered (random) matchings
• Closed expressions for averages of set partition statistics
• Crossings and nestings of matchings and partitions

This page was built for publication: Distribution of crossings, nestings and alignments of two edges in matchings and partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500952)