arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.02765math.CO
收藏

戴克编号,III。Enumeration与具有对称Dyck路的双射

Dyck Numbers, III. Enumeration and bijection with symmetric Dyck paths

Gennady Eremin

摘要:

戴克路径(也称为平衡括号和戴克词)是加泰罗尼亚语中研究最多的家族之一。本文是[2,3]的继续。本文列举了OEIS A036991中的Dyck数项,并构造了一个具有对称Dyck路的伴随双射。在Dyck路径的二进制编码的情况下,我们工作与紧凑的自然数去除前导零后。二进制后缀的分析,使我们能够获得任意A036991项和对称A036991项之间的双射编码对称Dyck路径。双射生成一个由一元不相交的无限树组成的森林。每个双射树的根是一个非对称项;其他节点是对称的。有无数这样的树。读者提供了一个软件包,用于处理双射树。

英文摘要:

Dyck paths (also balanced brackets and Dyck words) are among the most heavily studied Catalan families. This paper is a continuation of [2, 3]. In the paper we enumerate the terms of the OEIS A036991, Dyck numbers, and construct a concomitant bijection with symmetric Dyck paths. In the case of binary coding of Dyck paths we work with compact natural numbers after removing leading zeros. Analysis of binary suffixes, allowed us to obtain a bijection between arbitrary A036991 terms and symmetric A036991 terms which encode symmetric Dyck paths. The bijection generates a forest of unary non-intersecting infinite trees. The root of each bijection tree is an asymmetric term; the other nodes are symmetrical. There are an infinite number of such trees. The reader is offered a software package for working with bijection trees.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑