Studying the divisibility of power LCM matrics by power GCD matrices on gcd-closed sets

Abstract

Let $S=\{x_1,\ldots, x_n\}$ be a gcd-closed set (i.e. $(x_i,x_j)\in S $ for all $1\le i,j\le n$). In 2002, Hong proposed the divisibility problem of characterizing all gcd-closed sets $S$ with $|S|\ge 4$ such that the GCD matrix $(S)$ divides the LCM matrix $[S]$ in the ring $M_{n}(\mathbb{Z})$. For $x\in S,$ let $G_S(x):=\{z\in S: z<x, z|x \text{ and } (z|y|x, y\in S)\Rightarrow y\in\{z,x\}\}$. In 2009, Feng, Hong and Zhao answered this problem in the context where $\max_{x \in S}\{|G_S(x)|\} \leq 2$. In 2022, Zhao, Chen and Hong obtained a necessary and sufficient condition on the gcd-closed set $S$ with $\max_{x \in S}\{|G_S(x)|\}=3$ such that $(S)|\left[S\right].$ Meanwhile, they raised a conjecture on the necessary and sufficient condition such that $(S)|\left[S\right]$ holds for the remaining case $\max_{x \in S}\{|G_S(x)|\}\ge 4$. In this papar, we confirm the Zhao-Chen-Hong conjecture from a novel perspective, consequently solve Hong's open problem completely.

Figures (2)

• Figure 1: The Boolean lattice $B_2$ and $B_3$.
• Figure 2: The Boolean lattice $B_4$.

Theorems & Definitions (23)

• Definition 1.2
• Conjecture 1.3
• Conjecture 1.4
• Conjecture 1.5
• Lemma 2.1
• Lemma 2.2
• Lemma 2.3
• Lemma 2.4
• Lemma 2.5
• proof