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