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

Stieltjes矩性质与组合三角形的连分数

Stieltjes moment properties and continued fractions from combinatorial triangles

Bao-Xuan Zhu

摘要:

许多组合数可以放置在下面的广义三角形阵列$[T_{n,k}]_{n,k\ge 0}$满足递归关系:\begin{equation*} T_{n,k}=λ(a_0n+a_1k+a_2)T_{n-1,k}+(b_0n+b_1k+b_2)T_{n-1,k-1}+\frac{d(da_1-b_1)}λ(n-k+1)T_{n-1,k-2} \end{equation*}与$T_{0,0}=1$和$T_{n,k}=0$,除非$0\le k\le n$适合$a_0,a_1,a_2,b_0,b_1,b_2,d$和$λ$。对于$n\geq0$,用$T_n(q)$表示第$n$行的生成函数。本文基于$\sum_{n\geq0}T_n(q)t^n$的Jacobi连分式表达式,给出了$q$的$\textbf{x}$-Stieltjes矩性质和$3$-$\textbf{x}$-log凸性的各种判别准则,其中$\textbf{x}$是由$q$和递推关系中出现的参数组成的一组待定元.借助Wang和Zhu [Adv. in Appl. Math.(2016)]的一个准则,我们证明了$T_{n,k}$的相应线性变换保持序列的Stieltjes矩性质。最后,我们给出了一些相关的例子,包括阶乘数,惠特尼数,斯特林置换,极大极小树和峰值统计。

英文摘要:

Many combinatorial numbers can be placed in the following generalized triangular array $[T_{n,k}]_{n,k\ge 0}$ satisfying the recurrence relation: \begin{equation*} T_{n,k}=λ(a_0n+a_1k+a_2)T_{n-1,k}+(b_0n+b_1k+b_2)T_{n-1,k-1}+\frac{d(da_1-b_1)}λ(n-k+1)T_{n-1,k-2} \end{equation*} with $T_{0,0}=1$ and $T_{n,k}=0$ unless $0\le k\le n$ for suitable $a_0,a_1,a_2,b_0,b_1,b_2,d$ and $λ$. For $n\geq0$, denote by $T_n(q)$ the generating function of the $n$-th row. In this paper, we develop various criteria for $\textbf{x}$-Stieltjes moment property and $3$-$\textbf{x}$-log-convexity of $T_n(q)$ based on the Jacobi continued fraction expression of $\sum_{n\geq0}T_n(q)t^n$, where $\textbf{x}$ is a set of indeterminates consisting of $q$ and those parameters occurring in the recurrence relation. With the help of a criterion of Wang and Zhu [Adv. in Appl. Math. (2016)], we show that the corresponding linear transformation of $T_{n,k}$ preserves Stieltjes moment properties of sequences. Finally, we present some related examples including factorial numbers, Whitney numbers, Stirling permutations, minimax trees and peak statistics.

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

↑