Total nonnegativity of GCD matrices and kernels

From MaRDI portal
Publication:2321373

DOI10.1016/J.LAA.2019.05.016zbMATH Open1429.15031arXiv1901.01947OpenAlexW2906944596WikidataQ127825281 ScholiaQ127825281MaRDI QIDQ2321373FDOQ2321373

Dominique Guillot, Jiaru Wu

Publication date: 29 August 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Let X=(x1,dots,xn) be a vector of distinct positive integers. The nimesn matrix S=S(X):=(gcd(xi,xj))i,j=1n, where gcd(xi,xj) denotes the greatest common divisor of xi and xj, is called the greatest common divisor (GCD) matrix on X. 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 ngeq3, and is TN if and only if it is extrmTN2, i.e., all its 2imes2 minors are nonnegative. We next demonstrate that a GCD matrix is extrmTN2 if and only if the exponents of each prime divisor in the prime factorization of the xis form a monotonic sequence. Reformulated in the language of kernels, our results characterize the subsets of integers over which the kernel K(x,y)=gcd(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.


Full work available at URL: https://arxiv.org/abs/1901.01947




Recommendations




Cites Work


Cited In (1)





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)