Divisibility properties of power GCD matrices and power LCM matrices (Q2469527): Difference between revisions

Let \(S=\{x_1,x_2,\ldots,x_n\}\) be a set of \(n\) distinct positive integers, and let \(a\) and \(b\) be positive integers. The \(n\times n\) matrix \((S^a)\) having the \(a\)th power \((x_i,x_j)^a\) of the greatest common divisor of \(x_i\) and \(x_j\) as its \(ij\) entry is called the power GCD matrix on \(S\). The power LCM matrix \([S^a]\) is defined analogously. The author shows that if \(S\) is a divisor chain with \(n\geq 2\), then \((S^a)\) divides \((S^b)\) in the ring of \(n\times n\) matrices over the integers if and only if \(a\mid b\). Similar results for power LCM matrices and mixed cases are also obtained. The study of divisibility of GCD and related matrices was begun in \textit{K. Bourque} and \textit{S. Ligh} [Linear Algebra Appl. 174, 65--74 (1992; Zbl 0761.15013)]. For surveys of basic properties of GCD and related matrices see \textit{I. Korkee} and \textit{P. Haukkanen} [Linear Algebra Appl. 372, 127--153 (2003; Zbl 1036.06005)] and [\textit{J. Sándor} and \textit{B. Crstici}, Handbook of number theory II. Dordrecht: Kluwer Academic Publishers (2004; Zbl 1079.11001)].