Search arXivSearch

arXiv · 2501.01794

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianrong Zhao, Chenxu Wang, Yu Fu. 2025-01-03. Studying the divisibility of power LCM matrics by power GCD matrices on gcd-closed sets. https://arxiv.org/abs/2501.01794

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO