Contents

Ars Combinatoria

  • Research article

Bijections Between Bicoloured Ordered Trees And Non-Crossing Partitions

Chunlin Liu1, Zhenghua Wang2, Baodi Li1
1Department of Mathematics and System Science, College of Science, National University of Defense Technology, Changsha, Hunan 410073 P. R. China
2National Laboratory for Parallel and Distributed Processing, School of Computer, National University of Defense Technology, Changsha, Hunan 410073 P. R. China
  • Published: 31/10/2014

Abstract

Using new ways to label edges in an ordered tree, this paper introduces two bijections between bicoloured ordered trees and non-crossing partitions. Consequently, enumeration results of non-crossing partitions specified with several parameters are derived.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Chunlin Liu, Zhenghua Wang, Baodi Li. Bijections Between Bicoloured Ordered Trees And Non-Crossing Partitions[J], Ars Combinatoria, Volume 117. 155-162. .