DIVISIBILITY AMONG POWER GCD MATRICES AND POWER LCM MATRICES

Abstract For any integers x and y , let $(x, y)$ and $[x, y]$ stand for the greatest common divisor and the least common multiple of x and y , respectively. Let $a,b$ and n be positive integers, and let $S=\{x_1, \ldots , x_n\}$ be a set of n distinct positive integers. We denote by $(S^a)$ and $[S^a]$ the $n\times n$ matrices having the a th power of $(x_i,x_j)$ and $[x_i,x_j]$ , respectively, as the $(i,j)$ -entry. Bourque and Ligh [‘On GCD and LCM matrices’, Linear Algebra Appl. 174 (1992), 65–74] showed that if S is factor closed (that is, S contains all positive divisors of any element of S ), then the GCD matrix $(S)$ divides the LCM matrix $[S]$ (written as $(S)\mid [S]$ ) in the ring $M_n({\mathbb Z})$ of $n\times n$ matrices over the integers. Hong [‘Divisibility properties of power GCD matrices and power LCM matrices’, Linear Algebra Appl. 428 (2008), 1001–1008] proved that $(S^a)\mid (S^b)$ , $(S^a)\mid [S^b]$ and $[S^a]\mid [S^b]$ in the ring $M_{n}({\mathbb Z})$ when $a\mid b$ and S is a divi

Authors

Institutions

Publication Details

Journal
Bulletin of the Australian Mathematical Society
Published
2025-09-01
DOI
https://doi.org/10.1017/s0004972725100361
Citations
2
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
3.01

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DIVISIBILITY AMONG POWER GCD MATRICES AND POWER LCM MATRICES

Shaofang Hong
2 citations
Bulletin of the Australian Mathematical Society
Matrix Theory and Algorithms
3.01
article

DIVISIBILITY AMONG POWER GCD MATRICES AND POWER LCM MATRICES

Shaofang Hong
article en
2 citations

Abstract

Abstract For any integers x and y , let $(x, y)$ and $[x, y]$ stand for the greatest common divisor and the least common multiple of x and y , respectively. Let $a,b$ and n be positive integers, and let $S=\{x_1, \ldots , x_n\}$ be a set of n distinct positive integers. We denote by $(S^a)$ and $[S^a]$ the $n\times n$ matrices having the a th power of $(x_i,x_j)$ and $[x_i,x_j]$ , respectively, as the $(i,j)$ -entry. Bourque and Ligh [‘On GCD and LCM matrices’, Linear Algebra Appl. 174 (1992), 65–74] showed that if S is factor closed (that is, S contains all positive divisors of any element of S ), then the GCD matrix $(S)$ divides the LCM matrix $[S]$ (written as $(S)\mid [S]$ ) in the ring $M_n({\mathbb Z})$ of $n\times n$ matrices over the integers. Hong [‘Divisibility properties of power GCD matrices and power LCM matrices’, Linear Algebra Appl. 428 (2008), 1001–1008] proved that $(S^a)\mid (S^b)$ , $(S^a)\mid [S^b]$ and $[S^a]\mid [S^b]$ in the ring $M_{n}({\mathbb Z})$ when $a\mid b$ and S is a divi

Bulletin of the Australian Mathematical SocietyVol. 113(2)
Sichuan University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 7%
Matrix Theory and Algorithms
3.01
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

DIVISIBILITY AMONG POWER GCD MATRICES AND POWER LCM MATRICES — Shaofang Hong · Bulletin of the Australian Mathematical Society (2025) | TGRS Research Map | TGRS