论文标题
通过添加添加添加的新闻方法和应用程序来枚举Deutsch路径
Enumeration of Deutsch paths by adding the adding-a-new-slice method and applications
论文作者
论文摘要
Dyck路径的变化允许任意长度的下调，而不仅仅是一个。这是由于emeric deutsch引起的想法的动机。我们使用添加 - 新板技术和内核方法来计算长度为1的最大运行次数和Deutsch路径的子类满足R.Stanley对Dyck路径规定的条件。
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.
