On LCM matrices on GCD-closed sets (Q1304198): Difference between revisions

Let \(S = \{x_1, x_2, \ldots x_n\}\) be a set of \(n\) distinct positive integers. The matrix \((S)_n\) having the greatest common divisor \((x_i,x_j)\) of \(x_i\) and \(x_j\) as its \(i,j\) entry is called the greatest common divisor (GCD) matrix on \(S\). The study of GCD matrices was initiated by \textit{S. Beslin} and \textit{S. Ligh} [Linear Algebra Appl. 118, 69-76 (1989; Zbl 0672.15005)]. They showed that every GCD matrix is positive definite and is the product of a specified matrix and its transpose. The least common multiple (LCM) matrix on \(S\), denoted by \([S]_n\), is the \(n\times n\) matrix having the least common multiple \([x_i,x_j]\) of \(x_i\) and \(x_j\) as its \(i,j\) entry. A set \(S\) is GCD-closed if \((x_i,x_j) \in S\) for \(l \leq i, j \leq n\). In general, an LCM matrix need not be nonsingular, as pointed out by \textit{K. Bourque} and \textit{S. Ligh} [ibid. 174, 65-74 (1992; Zbl 0761.15013)]. In that paper they also conjectured that the LCM matrix \([S]_n\) defined on a GCD-closed set \(S\) is nonsingular. In the present paper the author shows that the conjecture is true for a certain class of GCD-closed sets \(S\).