On greatest common divisor matrices and their applications (Q1181834): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 00:36, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On greatest common divisor matrices and their applications |
scientific article |
Statements
On greatest common divisor matrices and their applications (English)
0 references
27 June 1992
0 references
If \(S=\{x_ 1,x_ 2,\ldots,x_ n\}\) is a set of positive integers, the \(n\times n\) matrix \([S]=((s_{ij}))\), where \(s_{ij}=(x_ i,x_ j)\) is the greatest common divisor (GCD) of \(x_ i\) and \(x_ j\), is called the greatest common divisor matrix on \(S\). The paper studies the structure of a GCD matrix and gives interesting relations between its determinant, Euler's totient function, and Möbius function. Some arithmetic progressions related to GCD matrices are also determined. Finally the author generalizes the results to general partially ordered sets and gives some applications.
0 references
greatest common divisor matrix
0 references
GCD matrix
0 references
determinant
0 references
Euler's totient function
0 references
Möbius function
0 references