期刊文献+

k-色斜Dyck路的计数 被引量:1

Enumeration of k-colored skew Dyck path
下载PDF
导出
摘要 本文研究k-色斜Dyck路的计数问题,给出半长为n的k-色斜Dyck路的数目s_n的计数公式、递推关系以及s_n/s_(n-1)的极限,并对半长、左步数、峰数、谷数以及双升数等参数给出了k-色斜Dyck路相应的计数公式. In this paper we study the enumeration of k-colored skew Dyck paths.We first give a counting formula and a recurrence for s_n and the limit of s_n/s_(n-1).We then give the counting formulas of the k-colored skew Dyck paths with semilength n according to the number of left steps and the number of peaks,valleys and double rises.
作者 卢青林
出处 《华东师范大学学报(自然科学版)》 CAS CSCD 北大核心 2015年第3期31-37,共7页 Journal of East China Normal University(Natural Science)
基金 国家自然科学基金(11171288 11171150)
关键词 Dyck路 k-色斜Dyck路 计数 Lagrange反演定理 Dyck path k-colored skew Dyck path enumeration Lagrange inversiontheorem
  • 相关文献

参考文献14

  • 1ALONSO L. Uniform generation of a Motzkin word [J]. Theoret Comput Sci, 1994, 134: 529-536.
  • 2DEUTSCHE. Dyck path enumeration [J]. Discrete Math, 1999, 204: 167-202.
  • 3DONAGHEY R, SHAPIRO L W. Motzkin numbers [J]. J Combin Theory Ser A, 1977, 23: 291-301.
  • 4MANSOUR T. Counting peaks at height k in a Dyck path [J]. J Integer Seq, 2002, 5: Article 02.1.1.
  • 5PEART P, WOAN W J. Dyck paths with no peaks at height k [J]. J Integer Seq, 2001, 4: Article 01.1.3.
  • 6PANAYOTOPOULAOS A, SAPOUNAKIS A. On the prime decomposition of Dyck words [J]. J Combin Math Combin Comput, 2002, 40: 33-39.
  • 7PANAYOTOPOULAOS A, SAPOUNAKIS A. On Motzkin words and noncrossing partitions [J]. Ars Combin, 2003, 69: 109-116.
  • 8SULANKE R A. Bijective recurrences for Motzkin paths [J]. Adv In Appl Math, 2001, 27: 627-640.
  • 9BARCUCCI E, LUNGO A D, PERGOLA E, et al. A construction for enumerating k-colored Motzkin paths [C]//Proc of the First Annual International Conference on Computing and Combinatorics Springer, 1995: 254- 263.
  • 10SAPOUNAKIS A, TSIKOURAS P. On k-colored Motzkin words [J]. J Integer Seq, 2004, 7: Article 04.2.5.

同被引文献1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部