Greatest common divisor matrices. (English) Zbl 0672.15005

Beslin, Scott; Ligh, Steve

Linear Algebra Appl. 118, 69-76 (1989).

Authors’ summary: Let \(S=\{x_ 1,x_ 2,...,x_ n\}\) be a set of distinct positive integers. The \(n\times n\) matrix \([S]=(s_{ij}),\) where \(s_{ij}=(x_ i,x_ j),\) the greatest common divisor of \(x_ i\) and \(x_ j\), is called the greatest common divisor (GCD) matrix of S. The paper studies the GCD matrices in the direction of their structure, determinant, and arithmetic in \(Z_ n\). Several open problems are posed.

Reviewer: R.Covaci

MSC:

15B36	Matrices of integers
15A15	Determinants, permanents, traces, other special matrix functions
11C20	Matrices, determinants in number theory
11A05	Multiplicative structure; Euclidean algorithm; greatest common divisors

Keywords:

greatest common divisor matrices; matrices of integers; determinant; arithmetic

References:

[1]	Apostol, T.M., Arithmetical properties of generalized Ramanujan sums, Pacific J. math., 41, 281-293, (1972) · Zbl 0226.10045
[2]	Birkhoff, G.; MacLane, S., A survey of modern algebra, (1965), MacMillan New York
[3]	Garcia, P.G.; Ligh, S., A generalization of Euler’s φ-function, Fibonacci quart., 21, 26-28, (1983) · Zbl 0503.10004
[4]	Ligh, S.; Garcia, P.G., A generalization of Euler’s φ-function, II, Math. japon., 30, 519-522, (1985) · Zbl 0576.10003
[5]	S. Ligh, Generalized Smith’s determinant, Linear and Multilinear Algebra, to appear.
[6]	McCarthy, P.J., A generalization of Smith’s determinant, Canad. math. bull., 29, 109-113, (1986) · Zbl 0588.10005
[7]	Niven, I.; Zuckerman, H.S., An introduction to the theory of numbers, (1980), Wiley New York · Zbl 0186.36601
[8]	Rotman, J.J., The theory of groups: an introduction, (1973), Allyn and Bacon Boston · Zbl 0262.20001
[9]	Smith, H.J.S., On the value of a certain arithmetical determinant, Proc. London math. soc., 7, 208-212, (1875-76) · JFM 08.0074.03