Pascal矩阵子矩阵的可逆性与Birkhoff插值
Invertibility of Submatrices of Pascal's Matrix and Birkhoff Interpolation
AI总结:
研究Pascal矩阵任意方子矩阵的可逆性,通过建立与多项式插值的联系,证明其可逆当且仅当行指标不大于列指标。
摘要:
无限上三角Pascal矩阵定义为 $T = [inom{j}{i}]$,其中 $0\leq i,j$。易见任何前主子方阵是三角阵且行列式为 $1$,因此可逆。本文研究由 $T$ 的行 $r=[r_0,\ldots,r_m]$ 和列 $c=[c_0,\ldots,c_m]$ 构成的任意方子矩阵 $T_{r,c}$ 的可逆性。我们证明 $T_{r,c}$ 可逆当且仅当 $r \leq c$(即对所有 $i=0,\ldots,m$ 有 $r_i \leq c_i$),等价地,当且仅当所有对角元非零。为证明此结果,我们建立了这些子矩阵的可逆性与多项式插值之间的联系。特别地,我们应用了Birkhoff插值和\polya{}系统的理论。
英文摘要:
The infinite upper triangular Pascal matrix is $T = [\binom{j}{i}]$ for $0\leq i,j$. It is easy to see that any leading principle square submatrix is triangular with determinant $1$, hence invertible. In this paper, we investigate the invertibility of arbitrary square submatrices $T_{r,c}$ comprised of rows $r=[r_0,\ldots,r_m]$ and columns $c=[c_0,\ldots,c_m]$ of $T$. We show that $T_{r,c}$ is invertible iff $r \leq c$ (i.e., $r_i \leq c_i$ for $i=0, \ldots, m$), or equivalently, iff all diagonal entries are nonzero. To prove this result we establish a connection between the invertibility of these submatrices and polynomial interpolation. In particular, we apply the theory of Birkhoff interpolation and \polya{} systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。