On the enumeration of parking functions by leading numbers

Sen Peng Eu*, Tung Shan Fu, Chun Ju Lai

*此作品的通信作者

研究成果: 會議貢獻類型會議論文同行評審

摘要

Let x = (x 1,..., x n) be a sequence of positive integers. An x-parking function is a sequence (a 1,..., a n) of positive integers whose non-decreasing rearrangement b 1 ≤ ⋯ ≤b n satisfies b i ≤ x 1 + ⋯ + x i. In this paper we give a combinatorial approach to the enumeration of (a, b,..., b)-parking functions by their leading terms, which covers the special cases x = (1,..., 1), (a, 1,..., 1), and (b,..., b). The approach relies on bijections between the x-parking functions and labeled rooted forests. To serve this purpose, we present a simple method for establishing the required bijections. Some bijective results between certain sets of x-parking functions of distinct leading terms are also given.

原文英語
頁面733-744
頁數12
出版狀態已發佈 - 2005
事件17th Annual International Conference on Algebraic Combinatorics and Formal Power Series, FPSAC'05 - Taormina, 意大利
持續時間: 2005 六月 202005 六月 25

其他

其他17th Annual International Conference on Algebraic Combinatorics and Formal Power Series, FPSAC'05
國家/地區意大利
城市Taormina
期間2005/06/202005/06/25

ASJC Scopus subject areas

  • 代數與數理論

指紋

深入研究「On the enumeration of parking functions by leading numbers」主題。共同形成了獨特的指紋。

引用此