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

Catalan数的Catalan变换的组合解释

A combinatorial interpretation of the Catalan transform of the Catalan numbers

David Callan

摘要:

序列(a_{n})_{n>=0}的Catalan变换是序列(b_{n})_{n>=0},其中b_{n} = Sum[k/(2n-k)(2n-k)-choose-(n-k)a_{k},k=0. n]。这里我们证明了Catalan数的Catalan变换有一个简单的解释:它计数函数f:[1,n] -> [1,n]满足的条件是,对于所有i<j,f(j)-(j-i)不在区间[1,f(i)-1]中。

英文摘要:

The Catalan transform of a sequence (a_{n})_{n>=0} is the sequence (b_{n})_{n>=0} with b_{n} = Sum[k/(2n-k) (2n-k)-choose-(n-k) a_{k},k=0..n]. Here we show that the Catalan transform of the Catalan numbers has a simple interpretation: it counts functions f:[1,n] -> [1,n] satisfying the condition that, for all i<j, f(j)-(j-i) is not in the interval [1,f(i)-1].

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

↑