矩阵Kronecker积的行列式:完全图的关联矩阵
Determinants in the Kronecker product of matrices: The incidence matrix of a complete graph
摘要:
研究了n阶完全图的两列整矩阵A和关联矩阵的Kronecker积的所有子行列式的最小公倍数lcmd(A × B).我们证明了这个量是lcmd(A)的n-1次方的最小公倍数和A的某些项的二项式函数。
英文摘要:
We investigate the least common multiple of all subdeterminants, lcmd(A x B), of a Kronecker product of matrices, of which one is an integral matrix A with two columns and the other is the incidence matrix of a complete graph with n vertices. We prove that this quantity is the least common multiple of lcmd(A) to the power n-1 and certain binomial functions of the entries of A.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。