Divisibility among power GCD and power LCM matrices on certain gcd-closed sets
Abstract
Let and denote the greatest common divisor and the least common multiple of the integers and respectively. We denote by the number of elements of a finite set . Let and be positive integers and let be a set of distinct positive integers. We denote by (resp. ) the matrix whose -entry is the th power of (resp. ). For any , define . In this paper, we show that if and is gcd closed (namely, for all integers and with ) and and the condition being satisfied (i.e., any element satisfies that either , or satisfying that and ), then and hold in the ring . Furthermore, we show the existences of gcd-closed sets such that does not satisfy the condition and such factorizations are true. Our result extends the Feng-Hong-Zhao theorem gotten in 2009. This also partially confirms a conjecture raised by Hong in [S.F. Hong, Divisibility among power GCD matrices and power LCM matrices, {\it Bull. Aust. Math. Soc.}, doi:10.1017/S0004972725100361].
Cite
@article{arxiv.2510.04799,
title = {Divisibility among power GCD and power LCM matrices on certain gcd-closed sets},
author = {Jixiang Wan and Guangyan Zhu},
journal= {arXiv preprint arXiv:2510.04799},
year = {2025}
}