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.     

Divisibility properties of power LCM matrices by power GCD matrices on gcd-closed sets

Let e and n be positive integers and S={x₁,…,x_n} a set of n distinct positive integers. For x∈S, define . The n×n matrix whose (i,j)-entry is the eth power (x_i,x_j)^e of the greatest common divisor of x_i and x_j is called the eth power GCD matrix on S, denoted by (S^e). Similarly we can define the eth power LCM matrix [S^e]. Bourque and Ligh showed that (S)∣[S] holds in the ring of n×n matrices over the integers if S is factor closed. Hong showed that for any gcd-closed set S with |S|≤3, (S)∣[S]. Meanwhile Hong proved that there is a gcd-closed set S with max_x∈S{|G_S(x)|}=2 such that (S)?[S]. In this paper, we introduce a new method to study systematically the divisibility for the case max_x∈S{|G_S(x)|}≤2. We give a new proof of Hong’s conjecture and obtain necessary and sufficient conditions on the gcd-closed set S with max_x∈S{|G_S(x)|}=2 such that (S^e)|[S^e]. This partially solves an open question raised by Hong. Furthermore, we show that such factorization holds if S is a gcd-closed set such that each element is a prime power or the product of two distinct primes, and in particular if S is a gcd-closed set with every element less than 12.     

有限个互素因子链上幂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的有限个因子链不互素,则此结论一般不成立.     

算术函数的多元扩张及其应用

定义在正整数集合上的复值函数称为算术函数．本文讨论算术函数的两种多元扩张及其对GCD函数矩阵与LCM函数矩阵的应用．     

GCD矩阵的一种推广

本文研究了有限个正整数直积上的GCD矩阵.利用Mbius反演得到了直积上的GCD矩阵性质和GCD矩阵行列式的计算方法.进一步,把正整数直积上的GCD矩阵推广到一般偏序集直积上,得到了广义GCD矩阵的性质.     

The Ingham Divisor Problem on the Set of Numbers without kth Powers

Suppose that k and l are integers such that and , M _k is a set of numbers without kth powers, and . In this paper, we obtain asymptotic estimates of the sums over      

关于Smarandache LCM函数的一类均方差问题

利用初等及解析方法研究均方差(SL(n)-(Ω)(n)))2的均值分布问题,并获得了一个有趣的渐近公式.     

Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy

We investigate differences in isomorphism types for Rogers semilattices of computable numberings of families of sets lying in different levels of the arithmetical hierarchy. Supported by RFBR grant No. 05-01-00819 and by INTAS grant No. 00-499. Supported by NSFC grant No. 60310213. __________ Translated from Algebra i Logika, Vol. 45, No. 6, pp. 637–654, November–December, 2006.     

一些新的数论函数及其均值公式

对于给定的自然数m,我们利用最大公约数和最小公倍数定义数论函数(m,n)和[m,n]/m.本文主要目的是研究这两个新的函数的渐近性质,利用解析方法得到这两个函数的几个渐近公式.     

A parallel extended GCD algorithm

A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O(n/logn) time using at most n¹⁺ processors on CRCW PRAM. Sorenson and Chor and Goldreich both use a modular approach which consider the least significant bits. By contrast, our algorithm only deals with the leading bits of the integers u and v, with uv. This approach is more suitable for extended GCD algorithms since the coefficients of the extended version a and b, such that au+bv=gcd(u,v), are deeply linked with the order of magnitude of the rational v/u and its continuants. Consequently, the computation of such coefficients is much easier.     

关于F.Smarandache LCM函数与除数函数的一个混合均值

利用初等及解析方法研究函数SL(n)与Dirichlet除数函数的加权均值问题,并获得一个有趣的渐近公式.     

On the ingham divisor problem

The main result of this paper is the following theorem. Suppose thatτ(n) = ∑ _d|n l and the arithmetical functionF satisfies the following conditions: