An Inequality for the Determinant of the GCD Matrix and the GCUD Matrix
Savolainen Juha
Abstract
Savolainen Juha
Abstract
Let S = {x_1, x_2,..., x_n } be a set of distinct positive integers. The n x n matrix (S) whose i, j-entry is the greatest common divisor (x_i, x_j) of x_i and x_j is called the GCD matrix on S. A divisor d of x is said to be a unitary divisor of x if (d, x/d) = 1. The greatest common unitary divisor (GCUD) matrix (S**) is defined analogously. We show that if S is both GCD-closed and GCUD-closed, then det(S**) ≥ det(S), where the equality holds if and Only if (S** ) = (S).
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let S = {x_1, x_2,..., x_n } be a set of distinct positive integers. The n x n matrix (S) whose i, j-entry is the greatest common divisor (x_i, x_j) of x_i and x_j is called the GCD matrix on S. A divisor d of x is said to be a unitary divisor of x if (d, x/d) = 1. The greatest common unitary divisor (GCUD) matrix (S**) is defined analogously. We show that if S is both GCD-closed and GCUD-closed, then det(S**) ≥ det(S), where the equality holds if and Only if (S** ) = (S).
Key concepts: Mathematics, Greatest common divisor, Divisor (algebraic geometry), Combinatorics, Matrix (chemical analysis), Unitary state, Unitary matrix, Discrete mathematics