Total nonnegativity of GCD matrices and kernels

. By a surprising result of Beslin and Ligh [Linear Algebra and Appl. 118], all GCD matrices are positive definite. In this paper, we completely characterize the GCD matrices satisfying the stronger property of being totally nonnegative (TN) or totally positive (TP). As we show, a GCD matrix is never TP when

n g e q 3

, and is TN if and only if it is

e x t r m {T N}_{2}

, i.e., all its

2 i m e s 2

minors are nonnegative. We next demonstrate that a GCD matrix is

e x t r m {T N}_{2}

if and only if the exponents of each prime divisor in the prime factorization of the

x_{i}

s form a monotonic sequence. Reformulated in the language of kernels, our results characterize the subsets of integers over which the kernel

K (x, y) = g c d (x, y)

is totally nonnegative. The proofs of our characterizations depend on Gantmacher and Krein's notion of a Green's matrix. We conclude by showing that a GCD matrix is TN if and only if it is a Green's matrix. As a consequence, we obtain explicit formulas for all the minors and for the inverse of totally nonnegative GCD matrices.

Review text

Let \(A=(a_{ij})_{m\times n}\) over \(\mathbb{N}\) and \(A[\alpha,\beta]=(a_{ij})_{i\in \alpha,j\in \beta}\) for any subset \(\alpha\) of \(\{1,\ldots,m\}\) and \(\beta\) of \(\{1,\ldots,n\}\). The matrix \(A\) is said to be totally nonnegative if \(\det(A[\alpha,\beta])\geq 0\) for all such \(\alpha\) and \(\beta\) of same cardinality. Given a list of \(n\) positive integers \(X=(x_1,\ldots,x_n)\), the GCD matrix of \(X\) is \(S(X)=\gcd(x_i,x_j)\). Among several other characterizations involving \(S(X)\), it is proved that for \(n\geq 3\), \(S(X)\) is totally nonnegative if and only if \(S(X)\) is Green's matrix.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: Total nonnegativity of GCD matrices and kernels

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