English

A simple bijection for enhanced, classical, and 2-distant k-noncrossing partitions

Combinatorics 2023-10-24 v2

Abstract

In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends δ\delta-distant k-crossings to (δ+1)(\delta+1)-distant k-crossings (and similarly for nestings). This map provides a combinatorial proof of the fact that the numbers of enhanced, classical, and 2-distant k-noncrossing partitions are each related to the next via the binomial transform. Our work resolves a recent conjecture of Zhicong Lin and generalizes earlier reduction identities for partitions.

Keywords

Cite

@article{arxiv.1806.09065,
  title  = {A simple bijection for enhanced, classical, and 2-distant k-noncrossing partitions},
  author = {Juan B. Gil and Jordan O. Tirrell},
  journal= {arXiv preprint arXiv:1806.09065},
  year   = {2023}
}

Comments

7 pages

R2 v1 2026-06-23T02:39:35.844Z