k-distant crossings and nestings of matchings and partitions

zbMATH Open1391.05044arXiv0812.2725MaRDI QIDQ3176580FDOQ3176580

Dan Drake, Jang Soo Kim

Publication date: 23 July 2018

Abstract: We define and consider k-distant crossings and nestings for matchings and set partitions, which are a variation of crossings and nestings in which the distance between vertices is important. By modifying an involution of Kasraoui and Zeng (Electronic J. Combinatorics 2006, research paper 33), we show that the joint distribution of k-distant crossings and nestings is symmetric. We also study the numbers of k-distant noncrossing matchings and partitions for small k, which are counted by well-known sequences, as well as the orthogonal polynomials related to k-distant noncrossing matchings and partitions. We extend Chen et al.'s r-crossings and enhanced r-crossings.

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

zbMATH Keywords

matchingsset partitionscrossingsnestings

Mathematics Subject Classification ID

Partitions of sets (05A18) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)

Cited In (4)

• A note on 2-distant noncrossing partitions and weighted Motzkin paths
• Bijections on two variations of noncrossing partitions
• On k-crossings and k-nestings of permutations
• A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions

This page was built for publication: $k$-distant crossings and nestings of matchings and partitions

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