Pascal矩阵的一种显式分解

本文引入了两种广义Pascal矩阵凡,P_n,k,Q_n,k以及两种广义Pascal函数矩阵O_n,k[x,y],Q_n,k[x,y],证明了Pascal矩阵能够表示成(0,1)-Jordan矩阵的乘积而且Pascal函数矩阵能分解成双对角矩阵的乘积.     

两类下三角形Pascal矩阵的相似性

本文研究了Pascal矩阵与位移Pascal矩阵之间的关系.利用组合恒等式与矩阵分解的方法,得到了Pascal矩阵以及位移Pascal矩阵与若当标准型之间的过渡矩阵.同时也得到了这两类矩阵在域Zp上的最小多项式.     

一个特殊的二项系数

利用发生函数和矩阵方法,研究了一个特殊的二项式系数[n λ n-k]和它所构成的矩阵.得到以[n λ n-k]为矩阵元素的Pascal型矩阵的指数分解和乘积分解公式.同时,考察了与二项式型多项式相伴的函数矩阵Pn,λ[x]及其性质.     

Reflecting the pascal matrix about its main antidiagonal

Let B denote either of two varieties of order n Pascal matrix, i.e., one whose entries are the binomial coefficients. Let B_R denote the reflection of B about its main antidiagonal. The matrix B is always invertible modulo n; our main result asserts that B^-1 ≡ B^R mod n if and only if n is prime. In the course of motivating this result we encounter and highlight some of the difficulties with the matrix exponential under modular arithmetic. We then use our main result to extend the "Fibonacci diagonal" property of Pascal matrices.     

用若当链构成分块矩阵计算若当标准形与相似变换矩阵

复数域上亏损矩阵的广义特征子空间的基的每个向量生成若当链,构成分块矩阵,施以初等变换,可求出若当基.获得若当标准形与相似变换矩阵的新算法.     

Reflecting the pascal matrix about its main antidiagonal

Let B denote either of two varieties of order n Pascal matrix, i.e., one whose entries are the binomial coefficients. Let B_R denote the reflection of B about its main antidiagonal. The matrix B is always invertible modulo n; our main result asserts that B^-1 ≡ B^R mod n if and only if n is prime. In the course of motivating this result we encounter and highlight some of the difficulties with the matrix exponential under modular arithmetic. We then use our main result to extend the "Fibonacci diagonal" property of Pascal matrices.     

A direct proof of theorem on generalized Jordan form of linear operators

The present paper gives a direct proof of the following result: for any linear operator over arbitrary field there exists a basis in which it has a polyquasicyclic matrix, i.e. a generalized Jordan form of second kind. The polyquasicyclic form of a linear operator is uniquely determined up to the order of direct summands on the diagonal, and it is shown that the generalized Jordan form of second kind is a link that connects the classical Jordan form and the rational canonical form.     

Pascal算子矩阵在组合恒等式中的应用

定义了四种Pascal算子矩阵,给出了它们的代数性质及它们之间的关系,并且利用二项式型多项式序列、算子及哑运算得到许多组合恒等式.     

Pascal算子矩阵在组合恒等式中的应用(英文)

定义了四种Pascal算子矩阵,给出了它们的代数性质及它们之间的关系,并且利用二项式型多项式序列、算子及哑运算得到许多组合恒等式.     

0-1对策的完全混合Nash均衡的代数求解法

将求解一般0-1策略对策的完全混合Nash均衡的问题转化为求解根为正的纯小数的高次代数方程组的问题.作为一种特殊而重要的情形,利用Pascal矩阵,Newton矩阵(对角元素为Newton二项式系数的对角矩阵)和Pascal-Newton矩阵(Pascal矩阵和Newton矩阵的逆阵的乘积)将求解对称0-1对策的完全混合Nash均衡的问题转化为求解根为正的纯小数的高次代数方程的问题,并给出第二问题的反问题(由完全混合Nash均衡求解对称0-1对策族)的求解方法.同时,给出了一些算例来说明对应问题的算法.