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

枚举函数

An Enumerative Function

Milan Janjic

摘要:

定义了一个计数函数F(n,k,P,m),它是二项式系数的推广.该函数的特例还有幂函数、因子、上升因子和下降因子。论文的第一部分是引言。在第二节中,我们导出了F的一个显式公式。由幂函数的表达式我们得到一个数论结果。然后我们导出一个公式,它表明任意m的情况可以简化为m=0的情况。这个公式扩展了范德蒙卷积。在第二节中,我们描述F的一系列递归关系的每一个参数k,n和P。作为一个特殊情况下的第一个递归关系,我们国家的二项式身份。作为第二个递推关系的结果,我们得到了这两类切比雪夫多项式系数的关系式。这意味着这些多项式可以用纯组合的方式定义。

英文摘要:

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is an introduction. In the second section we derive an explicit formula for F. From the expression for the power function we obtain a number theory result. Then we derive a formula which shows that the case of arbitrary m may be reduced to the case m=0. This formula extends Vandermonde convolution. In the second section we describe F by the series of recurrence relations with respect to each of arguments k, n, and P. As a special case of the first recurrence relation we state a binomial identity. As a consequence of the second recurrence relation we obtain relation for coefficients of Chebyshev polynomial of both kind. This means that these polynomials might be defined in pure combinatorial way.

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

↑