Contributions to Ma's conjecture concerning abelian difference sets with multiplier −1 (I)

IF 1.2 2区 数学 Q2 MATHEMATICS Journal of Combinatorial Theory Series A Pub Date : 2025-05-01 Epub Date: 2024-12-31 DOI:10.1016/j.jcta.2024.106004
Yasutsugu Fujita , Maohua Le
{"title":"Contributions to Ma's conjecture concerning abelian difference sets with multiplier −1 (I)","authors":"Yasutsugu Fujita ,&nbsp;Maohua Le","doi":"10.1016/j.jcta.2024.106004","DOIUrl":null,"url":null,"abstract":"<div><div>Let <span><math><mi>N</mi></math></span>, <span><math><mi>P</mi></math></span> be the sets of all positive integers and odd primes, respectively. In 1991, when studying the existence of abelian difference sets with multiplier −1, S.-L. Ma <span><span>[14]</span></span> conjectured that the equation <span><math><mo>(</mo><mo>⁎</mo><mo>)</mo></math></span> <span><math><msup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>=</mo><msup><mrow><mn>2</mn></mrow><mrow><mn>2</mn><mi>a</mi><mo>+</mo><mn>2</mn></mrow></msup><msup><mrow><mi>p</mi></mrow><mrow><mn>2</mn><mi>n</mi></mrow></msup><mo>−</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>a</mi><mo>+</mo><mn>2</mn></mrow></msup><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi><mo>+</mo><mi>n</mi></mrow></msup><mo>+</mo><mn>1</mn></math></span>, <span><math><mi>p</mi><mo>∈</mo><mi>P</mi><mo>,</mo><mspace></mspace><mi>x</mi><mo>,</mo><mi>z</mi><mo>,</mo><mi>m</mi><mo>,</mo><mi>n</mi><mo>∈</mo><mi>N</mi></math></span> has only one solution <span><math><mo>(</mo><mi>p</mi><mo>,</mo><mi>x</mi><mo>,</mo><mi>a</mi><mo>,</mo><mi>m</mi><mo>,</mo><mi>n</mi><mo>)</mo><mo>=</mo><mo>(</mo><mn>5</mn><mo>,</mo><mn>49</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>. This is a far from solved problem that has been poorly known for so long. In this paper, using some elementary methods, we first prove that if <span><math><mo>(</mo><mi>p</mi><mo>,</mo><mi>x</mi><mo>,</mo><mi>a</mi><mo>,</mo><mi>m</mi><mo>,</mo><mi>n</mi><mo>)</mo></math></span> is a solution of <span><math><mo>(</mo><mo>⁎</mo><mo>)</mo></math></span> with <span><math><mi>m</mi><mo>=</mo><mn>2</mn><mi>n</mi></math></span>, then there exist an odd positive integer <em>g</em> and a positive integer <em>t</em> which make <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>a</mi></mrow></msup><mo>=</mo><mo>(</mo><mi>g</mi><mo>+</mo><mn>1</mn><mo>)</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>t</mi><mo>+</mo><mn>1</mn></mrow></msub><mo>−</mo><mo>(</mo><mi>g</mi><mo>−</mo><mn>1</mn><mo>)</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>t</mi></mrow></msub></math></span> and <span><math><msup><mrow><mi>p</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>=</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>t</mi><mo>+</mo><mn>1</mn></mrow></msub><mo>+</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>t</mi></mrow></msub></math></span>, where <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>r</mi></mrow></msub><mo>=</mo><mo>(</mo><msup><mrow><mi>α</mi></mrow><mrow><mi>r</mi></mrow></msup><mo>−</mo><msup><mrow><mover><mrow><mi>α</mi></mrow><mrow><mo>¯</mo></mrow></mover></mrow><mrow><mi>r</mi></mrow></msup><mo>)</mo><mo>/</mo><mo>(</mo><mi>α</mi><mo>−</mo><mover><mrow><mi>α</mi></mrow><mrow><mo>¯</mo></mrow></mover><mo>)</mo></math></span> for any integer <em>r</em>, <span><math><mi>α</mi><mo>=</mo><mn>2</mn><mi>g</mi><mo>+</mo><msqrt><mrow><mn>4</mn><msup><mrow><mi>g</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mn>1</mn></mrow></msqrt></math></span> and <span><math><mover><mrow><mi>α</mi></mrow><mrow><mo>¯</mo></mrow></mover><mo>=</mo><mn>2</mn><mi>g</mi><mo>−</mo><msqrt><mrow><mn>4</mn><msup><mrow><mi>g</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mn>1</mn></mrow></msqrt></math></span>. Then, we obtain certain properties of the positive integers <em>t</em> and <em>g</em>. Finally, we comprehensively apply some classical results from transcendental number theory and Diophantine equations to prove that, for any fixed odd prime <em>p</em>, all solutions <span><math><mo>(</mo><mi>x</mi><mo>,</mo><mi>a</mi><mo>,</mo><mi>m</mi><mo>,</mo><mi>n</mi><mo>)</mo></math></span> of <span><math><mo>(</mo><mo>⁎</mo><mo>)</mo></math></span> with <span><math><mi>m</mi><mo>=</mo><mn>2</mn><mi>n</mi></math></span> satisfy <span><math><mi>x</mi><mo>&lt;</mo><mi>C</mi><mo>(</mo><mi>p</mi><mo>)</mo></math></span>, where <span><math><mi>C</mi><mo>(</mo><mi>p</mi><mo>)</mo></math></span> is an effectively computable constant depending only on <em>p</em>.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"212 ","pages":"Article 106004"},"PeriodicalIF":1.2000,"publicationDate":"2025-05-01","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/S0097316524001432","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/12/31 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Let N, P be the sets of all positive integers and odd primes, respectively. In 1991, when studying the existence of abelian difference sets with multiplier −1, S.-L. Ma [14] conjectured that the equation () x2=22a+2p2n2a+2pm+n+1, pP,x,z,m,nN has only one solution (p,x,a,m,n)=(5,49,3,2,1). This is a far from solved problem that has been poorly known for so long. In this paper, using some elementary methods, we first prove that if (p,x,a,m,n) is a solution of () with m=2n, then there exist an odd positive integer g and a positive integer t which make 2a=(g+1)vt+1(g1)vt and pn=vt+1+vt, where vr=(αrα¯r)/(αα¯) for any integer r, α=2g+4g2+1 and α¯=2g4g2+1. Then, we obtain certain properties of the positive integers t and g. Finally, we comprehensively apply some classical results from transcendental number theory and Diophantine equations to prove that, for any fixed odd prime p, all solutions (x,a,m,n) of () with m=2n satisfy x<C(p), where C(p) is an effectively computable constant depending only on p.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
对Ma关于乘子−1 (I)的阿贝尔差分集猜想的贡献
设N P分别为所有正整数和奇数素数的集合。1991年,在研究乘子−1的阿贝尔差分集的存在性时,s - l。Ma[14]推测方程()x2=22a+2p2n−2a+2pm+n+1, p∈p,x, z,m,n∈n只有一个解(p,x,a,m,n)=(5,49,3,2,1)。这是一个长期以来鲜为人知的远未解决的问题。本文利用一些初等方法,首先证明了如果(p,x,a,m,n)是m=2n时()的解,则存在一个奇正整数g和正整数t,使得2a=(g+1)vt+1−(g−1)vt和pn=vt+1+vt,其中对于任意整数r, α=2g+4g2+1和α¯=2g - 4g2+1, vr=(αr−α¯r)/(α−α¯)。最后,综合运用超越数论和丢芬图方程的经典结果,证明了对于任意固定奇素数p,当m=2n时,(f)的所有解(x,a,m,n)都满足x<;C(p),其中C(p)是仅依赖于p的有效可计算常数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
Extremal eigenvalues with respect to graph minors Robinson–Schensted shapes arising from cycle decompositions On quadruple systems with index λ Divisibility of Griesmer codes The maximum sum of the sizes of all intersections within m-size families
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1