Dan Drake ; Jang Soo Kim - $k$-distant crossings and nestings of matchings and partitions

dmtcs:2746 - Discrete Mathematics & Theoretical Computer Science, January 1, 2009, DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) - https://doi.org/10.46298/dmtcs.2746
$k$-distant crossings and nestings of matchings and partitionsArticle

Authors: Dan Drake 1; Jang Soo Kim 1

  • 1 Department of Mathematical Sciences, KAIST

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.


Volume: DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
Section: Proceedings
Published on: January 1, 2009
Imported on: January 31, 2017
Keywords: crossings,nestings,set partitions,matchings,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

3 Documents citing this article

Consultation statistics

This page has been seen 187 times.
This article's PDF has been downloaded 383 times.