Studying the divisibility of power LCM matrics by power GCD matrices on gcd-closed sets
Abstract
Let S=\x1,…, xn\ be a gcd-closed set (i.e. (xi,xj)∈ S for all 1 i,j n). In 2002, Hong proposed the divisibility problem of characterizing all gcd-closed sets S with |S| 4 such that the GCD matrix (S) divides the LCM matrix [S] in the ring Mn(Z). For x∈ S, let GS(x):=\z∈ S: z<x, z|x and (z|y|x, y∈ S)⇒ y∈\z,x\\. In 2009, Feng, Hong and Zhao answered this problem in the context where x ∈ S\|GS(x)|\ ≤ 2. In 2022, Zhao, Chen and Hong obtained a necessary and sufficient condition on the gcd-closed set S with x ∈ S\|GS(x)|\=3 such that (S)|[S]. Meanwhile, they raised a conjecture on the necessary and sufficient condition such that (S)|[S] holds for the remaining case x ∈ S\|GS(x)|\ 4. In this papar, we confirm the Zhao-Chen-Hong conjecture from a novel perspective, consequently solve Hong's open problem completely.
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.