Area of Catalan paths on a checkerboard

Szu En Cheng*, Sen Peng Eu, Tung Shan Fu

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

8 引文 斯高帕斯(Scopus)

摘要

It is known that the area of all Catalan paths of length n is equal to 4n - fenced(frac(2 n + 1, n)), which coincides with the number of inversions of all 321-avoiding permutations of length n + 1. In this paper, a bijection between the two sets is established. Meanwhile, a number of interesting bijective results that pave the way to the required bijection are presented.

原文英語
頁(從 - 到)1331-1344
頁數14
期刊European Journal of Combinatorics
28
發行號4
DOIs
出版狀態已發佈 - 2007 五月

ASJC Scopus subject areas

  • 離散數學和組合

指紋

深入研究「Area of Catalan paths on a checkerboard」主題。共同形成了獨特的指紋。

引用此