English

Divisibility among power GCD and power LCM matrices on certain gcd-closed sets

Number Theory 2025-10-07 v1

Abstract

Let (x,y)(x, y) and [x,y][x, y] denote the greatest common divisor and the least common multiple of the integers xx and yy respectively. We denote by T|T| the number of elements of a finite set TT. Let a,ba,b and nn be positive integers and let S={x1,...,xn}S=\{x_1, ..., x_n\} be a set of nn distinct positive integers. We denote by (Sa)(S^a) (resp. [Sa][S^a]) the n×nn\times n matrix whose (i,j)(i,j)-entry is the aath power of (xi,xj)(x_i,x_j) (resp. [xi,xj][x_i,x_j]). For any xSx\in S, define GS(x):={dS:d<x,dx and (dyx,yS)y{d,x}}G_{S}(x):=\{d\in S: d<x, d|x \ {\rm and} \ (d|y|x, y\in S)\Rightarrow y\in \{d,x\}\}. In this paper, we show that if aba|b and SS is gcd closed (namely, (xi,xj)S(x_i, x_j)\in S for all integers ii and jj with 1i,jn1\le i, j\le n) and maxxS{GS(x)}=2\max_{x\in S}\{|G_S (x)|\}=2 and the condition G\mathcal{G} being satisfied (i.e., any element xSx\in S satisfies that either GS(x)1|G_S(x)|\le 1, or GS(x)={y1,y2}G_S(x)=\{y_1,y_2\} satisfying that [y1,y2]=x[y_1,y_2]=x and (y1,y2)GS(y1)GS(y2)(y_1,y_2)\in G_S(y_1)\cap G_S(y_2)), then (Sa)(Sb),(Sa)[Sb](S^a)|(S^b), (S^a)|[S^b] and [Sa][Sb][S^a]|[S^b] hold in the ring Mn(Z)M_{n}({\bf Z}). Furthermore, we show the existences of gcd-closed sets SS such that SS does not satisfy the condition G\mathcal{G} 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].

Keywords

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}
}