Studying the divisibility of power LCM matrics by power GCD matrices on gcd-closed sets
Jianrong Zhao, Chenxu Wang, Yu Fu

TL;DR
This paper confirms a conjecture and completely solves an open problem regarding the divisibility of GCD matrices by LCM matrices on gcd-closed sets, extending previous work to cases where the set's structure is more complex.
Contribution
It proves the Zhao-Chen-Hong conjecture and provides a complete characterization of gcd-closed sets where GCD matrices divide LCM matrices, especially for cases with larger G_S(x) sets.
Findings
Confirmed the Zhao-Chen-Hong conjecture.
Provided a complete characterization for divisibility conditions.
Extended previous results to cases with larger G_S(x) sets.
Abstract
Let be a gcd-closed set (i.e. for all ). In 2002, Hong proposed the divisibility problem of characterizing all gcd-closed sets with such that the GCD matrix divides the LCM matrix in the ring . For let . In 2009, Feng, Hong and Zhao answered this problem in the context where . In 2022, Zhao, Chen and Hong obtained a necessary and sufficient condition on the gcd-closed set with such that Meanwhile, they raised a conjecture on the necessary and sufficient condition such that holds for the remaining case . In this papar, we confirm the Zhao-Chen-Hong…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Image Processing Techniques · Color Science and Applications · Graph Theory and Algorithms
