GCD matrix

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.

Definition

1	1	1	1	1	1	1	1	1	1
1	2	1	2	1	2	1	2	1	2
1	1	3	1	1	3	1	1	3	1
1	2	1	4	1	2	1	4	1	2
1	1	1	1	5	1	1	1	1	5
1	2	3	2	1	6	1	2	3	2
1	1	1	1	1	1	7	1	1	1
1	2	1	4	1	2	1	8	1	2
1	1	3	1	1	3	1	1	9	1
1	2	1	2	5	2	1	2	1	10
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\times 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 Smith (1875) who evaluated the determinant of certain GCD and LCM matrices. Smith showed among others that the determinant of the $n\times n$ matrix $(\gcd(i,j))$ is $\phi (1)\phi (2)\cdots \phi (n)$, where $\phi$ is Euler's totient function.

Bourque–Ligh conjecture

Bourque & Ligh (1992) conjectured that the LCM matrix on a GCD-closed set $S$ is nonsingular. This conjecture was shown to be false by Haukkanen, Wang & Sillanpää (1997) and subsequently by Hong (1999). A lattice-theoretic approach is provided by Korkee, Mattila & Haukkanen (2019).

The counterexample presented in Haukkanen, Wang & Sillanpää (1997) is $S=\{1,2,3,4,5,6,10,45,180\}$ and that in Hong (1999) 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 Korkee, Mattila & Haukkanen (2019).

The Hasse diagram of an odd GCD closed set whose LCM matrix is singular

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\times n$ matrices over the integers, that is there is an integral matrix $B$ such that $[S]=B(S)$, see Bourque & Ligh (1992). 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.