Fibonacci and Catalan paths in a wall

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2024-09-24 DOI:10.1016/j.disc.2024.114268

引用次数: 0

Abstract

We study the distribution of some statistics (width, number of steps, length, area) defined for paths contained in walls. We present the results by giving generating functions, asymptotic approximations, as well as some closed formulas. We prove algebraically that paths in walls of a given width and ending on the x-axis are enumerated by the Catalan numbers, and we provide a bijection between these paths and Dyck paths. We also find that paths in walls with a given number of steps are enumerated by the Fibonacci numbers. Finally, we give a constructive bijection between the paths in walls of a given length and peakless Motzkin paths of the same length.

查看原文本刊更多论文

墙上的斐波纳契和加泰罗尼亚路径

我们研究了为墙内路径定义的一些统计量（宽度、步数、长度、面积）的分布。我们通过给出生成函数、渐近近似值以及一些封闭公式来呈现结果。我们用代数方法证明，在给定宽度的墙壁中，以 x 轴为终点的路径可以用加泰罗尼亚数枚举，并提供了这些路径与戴克路径之间的双射关系。我们还发现，具有给定步数的墙内路径可以用斐波那契数枚举。最后，我们给出了给定长度的墙内路径与相同长度的无峰莫兹金路径之间的构造偏射。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.