Proof of Hong's conjecture on divisibility among power GCD and power LCM matrices on gcd-closed sets
Abstract
Let a and n be positive integers and let S=\x1, ·s, xn\ be a set of n distinct positive integers. For x∈ S, one defines GS(x)=\d∈ S: d<x, d|x \ and \ (d|y|x, y∈ S)⇒ y∈ \d,x\\. We denote by (Sa) (resp. [Sa]) the n× n matrix having the ath power of the greatest common divisor (resp. the least common multiple) of xi and xj as its (i,j)-entry. In this paper, we show that for arbitrary positive integers a and b with a|b, the bth power GCD matrix (Sb) and the bth power LCM matrix [Sb] are both divisible by the ath power GCD matrix (Sa) if S is a gcd-closed (i.e. (xi, xj)∈ S for all integers i and j with 1 i,j n) set satisfying the condition G (i.e., for any element x∈ S, either GS(x) contains at most one element, or GS(x) contains at least two elements and satisfies that [y1,y2]=x as well as (y1,y2)∈ GS(y1) GS(y2) for any \y1,y2\⊂eq GS(x)). This confirms a conjecture of Hong proposed in [S.F. Hong, Divisibility among power GCD matrices and power LCM matrices, Bull. Aust. Math. Soc. 113 (2026), 231-243].
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.