Skew-standard tableaux with three rows

Sen Peng Eu*

*此作品的通信作者

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

11 引文 斯高帕斯(Scopus)

摘要

Let T3 be the three-rowed strip. Recently Regev conjectured that the number of standard Young tableaux with n-3 entries in the "skew three-rowed strip" T3/(2,1,0) is mn-1-mn-3, a difference of two Motzkin numbers. This conjecture, together with hundreds of similar identities, were derived automatically and proved rigorously by Zeilberger via his powerful program and WZ method. It appears that each one is a linear combination of Motzkin numbers with constant coefficients. In this paper we will introduce a simple bijection between Motzkin paths and standard Young tableaux with at most three rows. With this bijection we answer Zeilberger's question affirmatively that there is a uniform way to construct bijective proofs for all of those identities.

原文英語
頁(從 - 到)463-469
頁數7
期刊Advances in Applied Mathematics
45
發行號4
DOIs
出版狀態已發佈 - 2010 十月

ASJC Scopus subject areas

  • 應用數學

指紋

深入研究「Skew-standard tableaux with three rows」主題。共同形成了獨特的指紋。

引用此