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

正切数与Genocchi数若干性质的组合证明

Combinatorial proofs of some properties of tangent and Genocchi numbers

Guo-Niu Han, Jing-Yi Liu

摘要:

切线数$T_{2n+1}$等于具有$2n+1$顶点的递增标号完全二叉树的数目。这种组合解释立即证明了$T_{2n+1}$可被$2^n$整除。然而,在伯努利数和Genocchi数的研究中已知更强的整除性,即$(n+1)T_{2n+1}$被$2^{2n}$整除。这一事实的传统证明需要大量的计算。在本文中,我们提供了一个组合的证明,后者整除使用树的钩长公式。此外,我们的方法被扩展到$k$ -ary树,导致一个新的推广的Genocchi数。

英文摘要:

The tangent number $T_{2n+1}$ is equal to the number of increasing labelled complete binary trees with $2n+1$ vertices. This combinatorial interpretation immediately proves that $T_{2n+1}$ is divisible by $2^n$. However, a stronger divisibility property is known in the studies of Bernoulli and Genocchi numbers, namely, the divisibility of $(n+1)T_{2n+1}$ by $2^{2n}$. The traditional proofs of this fact need significant calculations. In the present paper, we provide a combinatorial proof of the latter divisibility by using the hook length formula for trees. Furthermore, our method is extended to $k$-ary trees, leading to a new generalization of the Genocchi numbers.

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

↑