Divisibility among power GCD and power LCM matrices on certain gcd-closed sets
Authors
Jixiang Wan
Guangyan Zhu
Abstract
Let $(x, y)$ and $[x, y]$ denote the greatest common divisor and the least common multiple of the integers $x$ and $y$ respectively. We denote by $|T|$ the number of elements of a finite set $T$. Let $a,b$ and $n$ be positive integers and let $S=\{x_1, ..., x_n\}$ be a set of $n$ distinct positive integers. We denote by $(S^a)$ (resp. $[S^a]$) the $n\times n$ matrix whose $(i,j)$-entry is the $a$th power of $(x_i,x_j)$ (resp. $[x_i,x_j]$). For any $x\in S$, define $G_{S}(x):=\{d\in S: d
