GCD matrix explained

In mathematics, a greatest common divisor matrix (sometimes abbreviated as GCD matrix) is a matrix that may also be referred to as Smith's matrix. The study was initiated by H.J.S. Smith (1875). A new inspiration was begun from the paper of Bourque & Ligh (1992). This led to intensive investigations on singularity and divisibility of GCD type matrices. A brief review of papers on GCD type matrices before that time is presented in .

Definition

-

+

COLSPAN=10 ALIGN=CENTER

GCD matrix of (1,2,3,...,10)

Let

S = (x _{1,} x _{2,\ldots,} x _{n)} be a list of positive integers. Then the n x n matrix (S) having the greatest common divisor \gcd(x _{i,} x _{j)} as its ij entry is referred to as the GCD matrix on S .The LCM matrix [S] is defined analogously.

The study of GCD type matrices originates from who evaluated the determinant of certain GCD and LCM matrices. Smith showed among others that the determinant of the

n x n matrix (\gcd(i,j)) is \phi( 1 )\phi( 2 ) … \phi(n) , where \phi is Euler's totient function.

Bourque–Ligh conjecture

conjectured that the LCM matrix on a GCD-closed set

S is nonsingular. This conjecture was shown to be false by and subsequently by . A lattice-theoretic approach is provided by .

The counterexample presented in is

S = \{ 1 , 2 , 3 , 4 , 5 , 6 , 10 , 45 , 180 \} and that in is S = \{ 1 , 2 , 3 , 5 , 36 , 230 , 825 , 227700 \}. A counterexample consisting of odd numbers is S = \{ 1 , 3 , 5 , 7 , 195 , 291 , 1407 , 4025 , 1020180525 \} . Its Hasse diagram is presented on the right below.

The cube-type structures of these sets with respect to the divisibility relation are explained in .

Divisibility

Let

S = (x _{1,} x _{2,\ldots,} x _{n)} be a factor closed set. Then the GCD matrix (S) divides the LCM matrix [S] in the ring of n x n matrices over the integers, that is there is an integral matrix B such that [S] = B(S) , see . Since the matrices (S) and [S] are symmetric, we have [S] = (S) B ^{T} . Thus, divisibility from the right coincides with that from the left. We may thus use the term divisibility.

There is in the literature a large number of generalizations and analogues of this basic divisibility result.

Matrix norms

Some results on matrix norms of GCD type matrices are presented in the literature. Two basic results concern the asymptotic behaviour of the

\ell _{p} norm of the GCD and LCM matrix on S = \{ 1 , 2 , ... , n\} .

Given

p\in\N ^{+} , the \ell _{p} norm of an n x n matrix A is defined as\Vert A\Vert _{p =\left(\sum} ^{n} ^{i =1} \sum ^{n} _{j =1} |a _{ij} | ^{p} \right) ^{1/p} .

Let

S = \{ 1 , 2 , ... , n\} . If p\ge 2 , then \Vert (S)\Vert _{p=C} ^{1 /p} ^{p} n ^{1+(1/p)} + O((n ^{(1/p)-p} E _{p(n)),} where C _{p: = (2 \zeta(p) - \zeta(p +1 ))/((p +1 )\zeta(p +1 ))} and E ^{p} _{p(x) = x} for p> 2 and E ^{2log} _{2 (x) = x} x . Further, if p\ge 1 , then\Vert [S]\Vert _{p=D} ^{1 /p} ^{p} n ^{2+(2/p)} + O((n ^{(2/p)+1} ( log n) ^{2/3} ( loglog n) ^{4/3} ), where D _{p: = (\zeta(p +2 ))/((p +1 ) ^{2\zeta(p)})} .

Factorizations

Let

f be an arithmetical function, and let S = (x _{1,} x _{2,\ldots,} x _{n)} be a set of distinct positive integers. Then the matrix (S) _{f=(f(\gcd(x} _{i,} x _{j))} is referred to as the GCD matrix on S associated with f .The LCM matrix [S] _{f} on S associated with f is defined analogously. One may also use the notations (S) _{f=f(S)} and [S] _{f=f[S]} .

Let

S be a GCD-closed set. Then(S) _{f=E\Delta} E ^{T,} where E is the n x n matrix defined bye _{ij} = \begin{cases} 1 & if x _{j\mid} x _{i,\\ 0} & otherwise \end{cases} and \Delta is the n x n diagonal matrix, whose diagonal elements are\delta _{i=\sum} ^{d\mid x _{i\atop} {d\nmid x _{t\atop} x _{t<x} _{i}} }(f\star\mu)(d).Here \star is the Dirichlet convolution and \mu is the Möbius function.

Further, if

f is a multiplicative function and always nonzero,then[S] _{f=Λ} E\Delta ^{\prime} E ^{TΛ,} where Λ and \Delta' are the n x n diagonal matrices, whose diagonal elements areλ _{i=f(x} _{i)} and\delta ^{\prime = \sum} _{d\vert x _{i\atop} {d\nmid x _{t\atop} x _{t<x} _{i}} }(\frac\star\mu)(d).If S is factor-closed, then \delta _{i=(f\star\mu)(x} _{i)} and \delta ^{\prime = ( (1)/(f)} _{i} \star\mu)(x _{i)} .