Papers
Topics
Authors
Recent
Search
2000 character limit reached

Proof of Hong's conjecture on divisibility among power GCD and power LCM matrices on gcd-closed sets

Published 27 Mar 2026 in math.NT | (2603.26350v1)

Abstract: Let aa and nn be positive integers and let S=x1,,xnS={x_1, \cdots, x_n} be a set of nn distinct positive integers. For xSx\in S, one defines $G_{S}(x)={d\in S: d&lt;x, d|x \ {\rm and} \ (d|y|x, y\in S)\Rightarrow y\in {d,x}}$. We denote by (S<sup>a)(S<sup>a) (resp. [S<sup>a][S<sup>a]) the n×nn\times n matrix having the aath power of the greatest common divisor (resp. the least common multiple) of xix_i and xjx_j as its (i,j)(i,j)-entry. In this paper, we show that for arbitrary positive integers aa and bb with aba|b, the bbth power GCD matrix (S<sup>b)(S<sup>b) and the bbth power LCM matrix [S<sup>b][S<sup>b] are both divisible by the aath power GCD matrix (S<sup>a)(S<sup>a) if SS is a gcd-closed (i.e. gcd(xi,xj)S\gcd(x_i, x_j)\in S for all integers ii and jj with 1i,jn1\le i,j\le n) set satisfying the condition G\mathcal G (i.e., for any element xSx\in S, either GS(x)G_S(x) contains at most one element, or GS(x)G_S(x) contains at least two elements and satisfies that [y1,y2]=x[y_1,y_2]=x as well as (y1,y2)GS(y1)GS(y2)(y_1,y_2)\in G_S(y_1)\cap G_S(y_2) for any y1,y2GS(x){y_1,y_2}\subseteq G_S(x)). This confirms a conjecture of Hong proposed in [S.F. Hong, Divisibility among power GCD matrices and power LCM matrices, {\it Bull. Aust. Math. Soc.} {\bf 113} (2026), 231-243].

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.