New results on the divisibility of power GCD and power LCM matrices

AIMS Mathematics

article

Xiaofan Xu¹  Guangyan Zhu²  Mao Li³ 

[1] School of Big Data and Statistics, Sichuan Tourism University;School of Teacher Education, Hubei Minzu University;School of Mathematics and Statistics, Southwest University

关键词: divisibility;    power matrix;    greatest-type divisor;    gcd-closed set;   

DOI  :  10.3934/math.20221003

学科分类：地球科学(综合)

来源: AIMS Press

【 摘 要 】

Let $ a, b $ and $ n $ be positive integers and let $ S $ be a set consisting of $ n $ distinct positive integers $ x_1, ..., x_{n-1} $ and $ x_n $. Let $ (S^a) $ (resp. $ [S^a] $) denote the $ n\times n $ matrix having $ \gcd(x_i, x_j)^a $ (resp. $ {\rm lcm}(x_i, x_j)^a $) as its $ (i, j) $-entry. For any integer $ x\in S $, if $ (y < x, y|z|x \ {\rm and} \ y, z\in S)\Rightarrow z\in\{y, x\} $, then $ y $ is called a greatest-type divisor of $ x $ in $ S $. In this paper, we establish some results about the divisibility between $ (S^a) $ and $ (S^b) $, between $ (S^a) $ and $ [S^b] $ and between $ [S^a] $ and $ [S^b] $ when $ a|b $, $ S $ is gcd closed (i.e., $ \gcd(x_i, x_j)\in S $ for all $ 1\le i, j\le n $), and $ \max_{x\in S}\{|\{y\in S: y \ \text{is a greatest-type divisor of} \ x \ {\rm in} \ S\}|\} = 2 $.

【 授权许可】

CC BY