研究了幂LCM矩阵在GCD闭集上被幂GCD矩阵可整除的问题

IF 0.9 2区 数学 Q2 MATHEMATICS
Jianrong Zhao , Chenxu Wang , Yu Fu
{"title":"研究了幂LCM矩阵在GCD闭集上被幂GCD矩阵可整除的问题","authors":"Jianrong Zhao ,&nbsp;Chenxu Wang ,&nbsp;Yu Fu","doi":"10.1016/j.jcta.2025.106063","DOIUrl":null,"url":null,"abstract":"<div><div>Let <span><math><mi>S</mi><mo>=</mo><mo>{</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>}</mo></math></span> be a gcd-closed set (i.e. <span><math><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>)</mo><mo>∈</mo><mi>S</mi></math></span> for all <span><math><mn>1</mn><mo>≤</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo>≤</mo><mi>n</mi></math></span>). In 2002, Hong proposed the divisibility problem of characterizing all gcd-closed sets <em>S</em> with <span><math><mo>|</mo><mi>S</mi><mo>|</mo><mo>≥</mo><mn>4</mn></math></span> such that the GCD matrix (<em>S</em>) divides the LCM matrix <span><math><mo>[</mo><mi>S</mi><mo>]</mo></math></span> in the ring <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><mi>Z</mi><mo>)</mo></math></span>. For <span><math><mi>x</mi><mo>∈</mo><mi>S</mi></math></span>, let <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo><mo>:</mo><mo>=</mo><mo>{</mo><mi>z</mi><mo>∈</mo><mi>S</mi><mo>:</mo><mi>z</mi><mo>&lt;</mo><mi>x</mi><mo>,</mo><mi>z</mi><mo>|</mo><mi>x</mi><mtext> and </mtext><mo>(</mo><mi>z</mi><mo>|</mo><mi>y</mi><mo>|</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>∈</mo><mi>S</mi><mo>)</mo><mo>⇒</mo><mi>y</mi><mo>∈</mo><mo>{</mo><mi>z</mi><mo>,</mo><mi>x</mi><mo>}</mo><mo>}</mo></math></span>. In 2009, Feng, Hong and Zhao answered this problem in the context where <span><math><msub><mrow><mi>max</mi></mrow><mrow><mi>x</mi><mo>∈</mo><mi>S</mi></mrow></msub><mo>⁡</mo><mo>{</mo><mo>|</mo><msub><mrow><mi>G</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo><mo>|</mo><mo>}</mo><mo>≤</mo><mn>2</mn></math></span>. In 2022, Zhao, Chen and Hong obtained a necessary and sufficient condition on the gcd-closed set <em>S</em> with <span><math><msub><mrow><mi>max</mi></mrow><mrow><mi>x</mi><mo>∈</mo><mi>S</mi></mrow></msub><mo>⁡</mo><mo>{</mo><mo>|</mo><msub><mrow><mi>G</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo><mo>|</mo><mo>}</mo><mo>=</mo><mn>3</mn></math></span> such that <span><math><mo>(</mo><mi>S</mi><mo>)</mo><mo>|</mo><mrow><mo>[</mo><mi>S</mi><mo>]</mo></mrow></math></span>. Meanwhile, they raised a conjecture on the necessary and sufficient condition such that <span><math><mo>(</mo><mi>S</mi><mo>)</mo><mo>|</mo><mrow><mo>[</mo><mi>S</mi><mo>]</mo></mrow></math></span> holds for the remaining case <span><math><msub><mrow><mi>max</mi></mrow><mrow><mi>x</mi><mo>∈</mo><mi>S</mi></mrow></msub><mo>⁡</mo><mo>{</mo><mo>|</mo><msub><mrow><mi>G</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo><mo>|</mo><mo>}</mo><mo>≥</mo><mn>4</mn></math></span>. In this paper, we confirm the Zhao-Chen-Hong conjecture from a novel perspective, consequently solve Hong's open problem completely.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"215 ","pages":"Article 106063"},"PeriodicalIF":0.9000,"publicationDate":"2025-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Studying the divisibility of power LCM matrices by power GCD matrices on gcd-closed sets\",\"authors\":\"Jianrong Zhao ,&nbsp;Chenxu Wang ,&nbsp;Yu Fu\",\"doi\":\"10.1016/j.jcta.2025.106063\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Let <span><math><mi>S</mi><mo>=</mo><mo>{</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>}</mo></math></span> be a gcd-closed set (i.e. <span><math><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>j</mi></mrow></msub><mo>)</mo><mo>∈</mo><mi>S</mi></math></span> for all <span><math><mn>1</mn><mo>≤</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo>≤</mo><mi>n</mi></math></span>). In 2002, Hong proposed the divisibility problem of characterizing all gcd-closed sets <em>S</em> with <span><math><mo>|</mo><mi>S</mi><mo>|</mo><mo>≥</mo><mn>4</mn></math></span> such that the GCD matrix (<em>S</em>) divides the LCM matrix <span><math><mo>[</mo><mi>S</mi><mo>]</mo></math></span> in the ring <span><math><msub><mrow><mi>M</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><mi>Z</mi><mo>)</mo></math></span>. For <span><math><mi>x</mi><mo>∈</mo><mi>S</mi></math></span>, let <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo><mo>:</mo><mo>=</mo><mo>{</mo><mi>z</mi><mo>∈</mo><mi>S</mi><mo>:</mo><mi>z</mi><mo>&lt;</mo><mi>x</mi><mo>,</mo><mi>z</mi><mo>|</mo><mi>x</mi><mtext> and </mtext><mo>(</mo><mi>z</mi><mo>|</mo><mi>y</mi><mo>|</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>∈</mo><mi>S</mi><mo>)</mo><mo>⇒</mo><mi>y</mi><mo>∈</mo><mo>{</mo><mi>z</mi><mo>,</mo><mi>x</mi><mo>}</mo><mo>}</mo></math></span>. In 2009, Feng, Hong and Zhao answered this problem in the context where <span><math><msub><mrow><mi>max</mi></mrow><mrow><mi>x</mi><mo>∈</mo><mi>S</mi></mrow></msub><mo>⁡</mo><mo>{</mo><mo>|</mo><msub><mrow><mi>G</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo><mo>|</mo><mo>}</mo><mo>≤</mo><mn>2</mn></math></span>. In 2022, Zhao, Chen and Hong obtained a necessary and sufficient condition on the gcd-closed set <em>S</em> with <span><math><msub><mrow><mi>max</mi></mrow><mrow><mi>x</mi><mo>∈</mo><mi>S</mi></mrow></msub><mo>⁡</mo><mo>{</mo><mo>|</mo><msub><mrow><mi>G</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo><mo>|</mo><mo>}</mo><mo>=</mo><mn>3</mn></math></span> such that <span><math><mo>(</mo><mi>S</mi><mo>)</mo><mo>|</mo><mrow><mo>[</mo><mi>S</mi><mo>]</mo></mrow></math></span>. Meanwhile, they raised a conjecture on the necessary and sufficient condition such that <span><math><mo>(</mo><mi>S</mi><mo>)</mo><mo>|</mo><mrow><mo>[</mo><mi>S</mi><mo>]</mo></mrow></math></span> holds for the remaining case <span><math><msub><mrow><mi>max</mi></mrow><mrow><mi>x</mi><mo>∈</mo><mi>S</mi></mrow></msub><mo>⁡</mo><mo>{</mo><mo>|</mo><msub><mrow><mi>G</mi></mrow><mrow><mi>S</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo><mo>|</mo><mo>}</mo><mo>≥</mo><mn>4</mn></math></span>. In this paper, we confirm the Zhao-Chen-Hong conjecture from a novel perspective, consequently solve Hong's open problem completely.</div></div>\",\"PeriodicalId\":50230,\"journal\":{\"name\":\"Journal of Combinatorial Theory Series A\",\"volume\":\"215 \",\"pages\":\"Article 106063\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-05-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory Series A\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0097316525000585\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316525000585","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

设S={x1,…,xn}是一个gcd闭集(即(xi,xj)∈S,对于所有1≤i,j≤n)。2002年,Hong提出了表征所有GCD -闭集S的|S|≥4使得GCD矩阵(S)能除环Mn(Z)中的LCM矩阵[S]的可分性问题。x∈年代,让GS (x): = {z∈年代:z< x, z | x和y z | | x, y∈(S)⇒y∈{z、x}}。2009年,Feng, Hong和Zhao在maxx∈S∈{|GS(x)|}≤2的情况下回答了这个问题。Zhao、Chen和Hong在2022年得到了maxx∈S∈S (|GS(x)|}=3的gcd-闭集S上的一个充要条件,使得(S)|[S]。同时,他们提出了一个关于(S)|[S]对剩余情况maxx∈S∈{|GS(x)|}≥4成立的充分必要条件的猜想。本文从一个全新的角度证实了赵-陈-洪猜想,从而彻底解决了洪的开放问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Studying the divisibility of power LCM matrices by power GCD matrices on gcd-closed sets
Let S={x1,,xn} be a gcd-closed set (i.e. (xi,xj)S for all 1i,jn). 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 xS, let GS(x):={zS:z<x,z|x and (z|y|x,yS)y{z,x}}. In 2009, Feng, Hong and Zhao answered this problem in the context where maxxS{|GS(x)|}2. In 2022, Zhao, Chen and Hong obtained a necessary and sufficient condition on the gcd-closed set S with maxxS{|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 maxxS{|GS(x)|}4. In this paper, we confirm the Zhao-Chen-Hong conjecture from a novel perspective, consequently solve Hong's open problem completely.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.90
自引率
9.10%
发文量
94
审稿时长
12 months
期刊介绍: The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信