最大公因数闭集上幂矩阵的行列式整除性

设S={x1,…,xn)是由n个不同正整数组成的最大公因数闭集,我们证明: (1)如果n≤3,则对(?)ε∈Z+,有det(S)nε整除det[S]nε;(2)如果maxxi∈S{xi}<12, 则对(?)ε∈Z+,有det(S)nε整除det[S]nε;(3)如果maxx∈S{R(x)}≤1,其中R(x)是x 在S中的最大型因子集,则对(?)ε∈Z+,有det(S)nε整除det[S]nε．     

一些二项式系数的最大公因数（英文）

本文证明:若n≥4和a≥0为整数且满足a m+b(n, p),m∈N和0≤b(n, p)≤a的素数p.作为上述结论的一个应用,我们回答洪[3]文中的一个问题.     

关于最大公因数的一个定理的推广

本文推广了关于最大公因数的一个定理.     

格矩阵的行列式与伴随矩阵

研究了格矩阵的行列式与伴随矩阵,给出了它们的一些代数性质,同时给出了由一个格矩阵构造一个传递矩阵的方法.     

四元数矩阵的实值行列式

本文定义了任一个四元数方阵的实值行列式．实值行列式有一些好的性质，它是按照谢邦杰定义的可中心化四元数矩阵的行列式的推广．     

矩阵基础上的行列式理论

首先证明矩阵的伴随矩阵存在性定理,其次利用递推定义方法建立行列式概念,由此可构建矩阵基础上的行列式理论。     

Quantale矩阵的行列式的若干性质

基于Q uan ta le矩阵的定义,本文讨论了Q uan ta le矩阵的行列式的若干性质。在交换Q uan ta le情形下,得到AB≥A B,AB≤A B,AA*≤A,其中A*表示Q uan ta le上的矩阵A的伴随矩阵。     

矩阵乘积的一个行列式等式的证明

介绍利用初等矩阵与初等变换的关系证明矩阵乘积的一个行列式等式 ｜A·B｜=｜A｜·｜B｜。     

正定Hermite矩阵的若干行列式不等式

本文对满足条件Ａ^Ｈ＝Ａ＞０，１／２（Ｂ＋Ｂ^Ｈ）≥０的矩阵Ａ，Ｂ，建立了四个行列式不等式．某些著名的行列式不等式和一些已知结用，均可作为其推论．     

Degree distribution of the greatest common divisor of polynomials over 𝔽q

We study the degree distribution of the greatest common divisor of two or more random polynomials over a finite field ??_q. We provide estimates for several parameters like number of distinct common irreducible factors, number of irreducible factors counting repetitions, and total degree of the gcd of two or more polynomials. We show that the limiting distribution of a random variable counting the total degree of the gcd is geometric and that the distributions of random variables counting the number of common factors (with and without repetitions) are very close to Poisson distributions when q is large. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

On computation of the greatest common divisor of several polynomials over a finite field

We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field.     

Divisibility of determinants of power GCD matrices and power LCM matrices on finitely many quasi-coprime divisor chains

Let a, n ? 1 be integers and S = {x₁, … , x_n} be a set of n distinct positive integers. The matrix having the ath power (x_i, x_j)^a of the greatest common divisor of x_i and x_j as its i, j-entry is called ath power greatest common divisor (GCD) matrix defined on S, denoted by (S^a). Similarly we can define the ath power LCM matrix [S^a]. We say that the set S consists of finitely many quasi-coprime divisor chains if we can partition S as S = S₁ ∪ ? ∪ S_k, where k ? 1 is an integer and all S_i (1 ? i ? k) are divisor chains such that (max(S_i), max(S_j)) = gcd(S) for 1 ? i ≠ j ? k. In this paper, we first obtain formulae of determinants of power GCD matrices (S^a) and power LCM matrices [S^a] on the set S consisting of finitely many quasi-coprime divisor chains with gcd(S) ∈ S. Using these results, we then show that det(S^a)∣det(S^b), det[S^a]∣det[S^b] and det(S^a)∣det[S^b] if a∣b and S consists of finitely many quasi-coprime divisor chains with gcd(S) ∈ S. But such factorizations fail to be true if such divisor chains are not quasi-coprime.     

Symbolic calculation of greatest common divisor of 2D polynomial matrices

An automatic process by which the greatest common divisor of2D polynomial matrices can be calculated using the symboliccomputation package MAPLE.     

有限个互素因子链上幂GCD矩阵与幂LCM矩阵的行列式的整除性

设S={x1,x2,...,xn}是由n个不同的正整数组成的集合,并设a为正整数.如果一个n阶矩阵的第i行j列元素是S中元素xi和xj的最大公因子的a次幂(xi,xj)a,则称该矩阵为定义在S上的a次幂最大公因子(GCD)矩阵,用(Sa)表示;类似定义a次幂LCM矩阵[Sa].如果存在{1,2,...,n}上的一个置换σ使得xσ(1)|xσ(2)|···|xσ(n),则称S为一个因子链.如果存在正整数k,使得S=S1∪S2∪···∪Sk,其中每一个Si(1ik)均为一个因子链,并且对所有的1i=jk,Si中的每个元素与Sj中的每个元素互素,则称S由有限个互素因子链构成.本文中,设S由有限个互素的因子链构成,并且1∈S.我们首先给出幂GCD矩阵与幂LCM矩阵的行列式的公式,然后证明:如果a|b,则det(Sa)|det(Sb),det[Sa]|det[Sb],det(Sa)|det[Sb].最后我们指出:如果构成S的有限个因子链不互素,则此结论一般不成立.     

矩阵的最大公因子

本文提出两个矩阵右最大公因子的概念 ,给出其表达式 ,并将其推广到多个矩阵的情形     

The greatest common divisor of certain sets of binomial coefficients

A formula is obtained for the greatest common divisor of any number of consecutive terms in any given row of Pascal's triangle.     

On the probability that n and [n c] are coprime

We prove that for any positive real number which is not an integer, the density of the integers which are coprime to , a result conjectured by Moser, Lambek and Erd Hs. This revised version was published online in June 2006 with corrections to the Cover Date.