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

Juan B. Gil, Jordan O. Tirrell

Research output: Contribution to journalArticlepeer-review

Abstract

In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends δ-distant k-crossings to (δ+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.

Original languageEnglish (US)
Article number111705
JournalDiscrete Mathematics
Volume343
Issue number6
DOIs
StatePublished - Jun 2020

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'A simple bijection for enhanced, classical, and 2-distant k-noncrossing partitions'. Together they form a unique fingerprint.

Cite this