scientific article; zbMATH DE number 1998742

Publication date 29 October 2003

GCD matrix LCM matrix meet matrix Smith's determinant unitary divisor

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Arithmetic functions; related numbers; inversion formulas (11A25) Matrices, determinants in number theory (11C20) Matrices of integers (15B36)

Review text

Let \(S=\{x_1, x_2,\ldots, x_n\}\) be a set of positive integers, and let \(A\) denote the \(n\times n\) matrix whose \(ij\)-entry is \(({(x_i, x_j)^{\ast\ast}\over [x_i, x_j]^{\ast\ast}})\), where \((x_i, x_j)^{\ast\ast}\) and \([x_i, x_j]^{\ast\ast}\) respectively are unitary analogues of the usual greatest common divisor and least common multiple. The authors study the structure, the determinant and the inverse of the matrix \(A\). Reviewer's remark: Some of the proofs in this paper could be simplified. The determinant of the matrix \(A\) has also been studied by the authors in [Int. Math. J. 3, No. 4, 455--459 (2003)]. Similar properties of the matrix \(({[x_i, x_j]^{\ast\ast}\over (x_i, x_j)^{\ast\ast}})\), the reciprocal matrix of \(A\), have been studied by \textit{N.~Tuglu} and the second author in [C.~R.~Acad. Bulgare Sci. 55, No. 12, 17--20 (2002; Zbl 1011.11016)]. The usual GCD/LCM matrix \(({(x_i, x_j)\over [x_i, x_j]})\) has been studied by the authors in [Int. Math. J. 3, 455--459 (2003); ibid. 3, 461--466 (2003) and Math. Comput. Appl. 9, 101--106 (2004; Zbl 1115.11017)]. The matrix \(({[i, j]\over (i, j)})\) has been studied by \textit{N.~Tuglu} and the second author [Far East J. Math. Sci. (FJMS) 6, No. 1, 89--94 (2002; Zbl 1034.11023)]. All the above mentioned results can be generalized for meet matrices on posets applying the methods in \textit{I.~Korkee} and \textit{P.~Haukkanen} [Linear Algebra Appl. 372, 127--153 (2003; Zbl 1036.06005)].

Recommendations

Cited in

(10)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4433358)