


























A variation of Dyck paths allows for down-steps of arbitrary length, not just one. This is motivated by ideas due to Emeric Deutsch. We use the adding-a-new-slice technique and the kernel method to compute the number of maximal runs of up-step runs of length 1 and a subclass of Deutsch paths satisfying a condition that was stipulated by R. Stanley for Dyck paths.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。