加载中…
We calculate the number of humps and peaks in Motzkin paths with a given height, and calculate the number of standard Young tableaux (SYTs) in a -hook with the difference of the first two parts fixed, which refine Regev’s results in 2009. We also give new combinatorial proofs of Regev’s results, and reveal some new recurrence relations related to humps, free Motzkin paths and SYTs.

生成讲解博客的中文版本

生成AI智能校验的中文版本