Skip to Main content Skip to Navigation
Conference papers

$k$-distant crossings and nestings of matchings and partitions

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.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 20, 2015 - 11:09:50 AM
Last modification on : Tuesday, March 7, 2017 - 3:05:33 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:42:39 AM


Publisher files allowed on an open archive




Dan Drake, Jang Soo Kim. $k$-distant crossings and nestings of matchings and partitions. 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. pp.349-360, ⟨10.46298/dmtcs.2746⟩. ⟨hal-01185439⟩



Record views


Files downloads