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

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 4 figures, Sage code appendix; v2: fix a couple typos, thanks Philippe Nadeau; v3: fix more typos, accepted for FPSA

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

$k$-distant crossings and nestings of matchings and partitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with $k$-distant crossings and nestings of matchings and partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and $k$-distant crossings and nestings of matchings and partitions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-348680

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.