Notes on the divisibility of GCD and LCM matrices.
Haukkanen, Pentti, Korkee, Ismo (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Haukkanen, Pentti, Korkee, Ismo (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ishikawa, Masao, Kawamuko, Hiroyuki, Okada, Soichi (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Siao Hong, Shuangnian Hu, Shaofang Hong (2016)
Open Mathematics
Similarity:
Let f be an arithmetic function and S = {x1, …, xn} be a set of n distinct positive integers. By (f(xi, xj)) (resp. (f[xi, xj])) we denote the n × n matrix having f evaluated at the greatest common divisor (xi, xj) (resp. the least common multiple [xi, xj]) of x, and xj as its (i, j)-entry, respectively. The set S is said to be gcd closed if (xi, xj) ∈ S for 1 ≤ i, j ≤ n. In this paper, we give formulas for the determinants of the matrices (f(xi, xj)) and (f[xi, xj]) if S consists of...
Ovall, Jeffrey S. (2004)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Xin, Guoce (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Shaofang Hong, Qi Sun (2004)
Czechoslovak Mathematical Journal
Similarity:
Let be a finite subset of a partially ordered set . Let be an incidence function of . Let denote the matrix having evaluated at the meet of and as its -entry and denote the matrix having evaluated at the join of and as its -entry. The set is said to be meet-closed if for all . In this paper we get explicit combinatorial formulas for the determinants of matrices and on any meet-closed set . We also obtain necessary and sufficient conditions for...
Jaromír Šimša (1992)
Archivum Mathematicum
Similarity:
We establish some criteria for a nonsingular square matrix depending on several parameters to be represented in the form of a matrix product of factors which depend on the single parameters.