大型集合的 A(A + A) 新界限

IF 0.6 3区 数学 Q3 MATHEMATICS
Aliaksei Semchankau
{"title":"大型集合的 A(A + A) 新界限","authors":"Aliaksei Semchankau","doi":"10.1016/j.jnt.2024.08.002","DOIUrl":null,"url":null,"abstract":"<div><div>For a large prime number <em>p</em> and a set <span><math><mi>A</mi><mo>⊂</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>p</mi></mrow></msub></math></span> we prove the following:<ul><li><span>(1)</span><span><div>If <span><math><mi>A</mi><mo>(</mo><mi>A</mi><mo>+</mo><mi>A</mi><mo>)</mo></math></span> does not cover all nonzero residues in <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>p</mi></mrow></msub></math></span>, then <span><math><mo>|</mo><mi>A</mi><mo>|</mo><mo>⩽</mo><mi>p</mi><mo>/</mo><mn>8</mn><mo>+</mo><mi>o</mi><mo>(</mo><mi>p</mi><mo>)</mo></math></span>.</div></span></li><li><span>(2)</span><span><div>If <em>A</em> is both sum-free and satisfies <span><math><mi>A</mi><mo>=</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math></span>, then <span><math><mo>|</mo><mi>A</mi><mo>|</mo><mo>⩽</mo><mi>p</mi><mo>/</mo><mn>9</mn><mo>+</mo><mi>o</mi><mo>(</mo><mi>p</mi><mo>)</mo></math></span>.</div></span></li><li><span>(3)</span><span><div>If <span><math><mo>|</mo><mi>A</mi><mo>|</mo><mo>≫</mo><mfrac><mrow><mi>log</mi><mo>⁡</mo><mi>log</mi><mo>⁡</mo><mi>p</mi></mrow><mrow><msqrt><mrow><mi>log</mi><mo>⁡</mo><mi>p</mi></mrow></msqrt></mrow></mfrac><mi>p</mi></math></span>, then <span><math><mo>|</mo><mi>A</mi><mo>+</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>|</mo><mo>⩾</mo><mo>(</mo><mn>1</mn><mo>+</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo><mo>)</mo><mi>min</mi><mo>⁡</mo><mo>(</mo><mn>2</mn><msqrt><mrow><mo>|</mo><mi>A</mi><mo>|</mo><mi>p</mi></mrow></msqrt><mo>,</mo><mi>p</mi><mo>)</mo></math></span>.</div></span></li></ul> Here the constants 1/8, 1/9, 2 are the best possible. Proofs make use of <em>wrappers</em>, subsets of a finite abelian group <em>G</em>, which ‘wrap’ popular values in convolutions of dense sets <span><math><mi>A</mi><mo>,</mo><mi>B</mi><mo>⊆</mo><mi>G</mi></math></span>. These objects carry certain structural features, making them capable of addressing additive-combinatorial and enumerative problems.</div></div>","PeriodicalId":50110,"journal":{"name":"Journal of Number Theory","volume":"268 ","pages":"Pages 142-162"},"PeriodicalIF":0.6000,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new bound for A(A + A) for large sets\",\"authors\":\"Aliaksei Semchankau\",\"doi\":\"10.1016/j.jnt.2024.08.002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>For a large prime number <em>p</em> and a set <span><math><mi>A</mi><mo>⊂</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>p</mi></mrow></msub></math></span> we prove the following:<ul><li><span>(1)</span><span><div>If <span><math><mi>A</mi><mo>(</mo><mi>A</mi><mo>+</mo><mi>A</mi><mo>)</mo></math></span> does not cover all nonzero residues in <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>p</mi></mrow></msub></math></span>, then <span><math><mo>|</mo><mi>A</mi><mo>|</mo><mo>⩽</mo><mi>p</mi><mo>/</mo><mn>8</mn><mo>+</mo><mi>o</mi><mo>(</mo><mi>p</mi><mo>)</mo></math></span>.</div></span></li><li><span>(2)</span><span><div>If <em>A</em> is both sum-free and satisfies <span><math><mi>A</mi><mo>=</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math></span>, then <span><math><mo>|</mo><mi>A</mi><mo>|</mo><mo>⩽</mo><mi>p</mi><mo>/</mo><mn>9</mn><mo>+</mo><mi>o</mi><mo>(</mo><mi>p</mi><mo>)</mo></math></span>.</div></span></li><li><span>(3)</span><span><div>If <span><math><mo>|</mo><mi>A</mi><mo>|</mo><mo>≫</mo><mfrac><mrow><mi>log</mi><mo>⁡</mo><mi>log</mi><mo>⁡</mo><mi>p</mi></mrow><mrow><msqrt><mrow><mi>log</mi><mo>⁡</mo><mi>p</mi></mrow></msqrt></mrow></mfrac><mi>p</mi></math></span>, then <span><math><mo>|</mo><mi>A</mi><mo>+</mo><msup><mrow><mi>A</mi></mrow><mrow><mo>⁎</mo></mrow></msup><mo>|</mo><mo>⩾</mo><mo>(</mo><mn>1</mn><mo>+</mo><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo><mo>)</mo><mi>min</mi><mo>⁡</mo><mo>(</mo><mn>2</mn><msqrt><mrow><mo>|</mo><mi>A</mi><mo>|</mo><mi>p</mi></mrow></msqrt><mo>,</mo><mi>p</mi><mo>)</mo></math></span>.</div></span></li></ul> Here the constants 1/8, 1/9, 2 are the best possible. Proofs make use of <em>wrappers</em>, subsets of a finite abelian group <em>G</em>, which ‘wrap’ popular values in convolutions of dense sets <span><math><mi>A</mi><mo>,</mo><mi>B</mi><mo>⊆</mo><mi>G</mi></math></span>. These objects carry certain structural features, making them capable of addressing additive-combinatorial and enumerative problems.</div></div>\",\"PeriodicalId\":50110,\"journal\":{\"name\":\"Journal of Number Theory\",\"volume\":\"268 \",\"pages\":\"Pages 142-162\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Number Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0022314X24001914\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Number Theory","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022314X24001914","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

对于一个大素数 p 和一个集合 A⊂Fp,我们证明如下:(1)如果 A(A+A) 没有覆盖 Fp 中的所有非零残差,那么 |A|⩽p/8+o(p)。(2)如果 A 既无和且满足 A=A⁎,则|A|⩽p/9+o(p)。 (3)如果|A|≫loglogplogpp,则|A+A⁎|⩾(1+o(1))min(2|A|p,p)。这里的常数 1/8、1/9、2 是可能的最佳值。这些对象具有某些结构特征,使它们能够解决加法组合问题和枚举问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new bound for A(A + A) for large sets
For a large prime number p and a set AFp we prove the following:
  • (1)
    If A(A+A) does not cover all nonzero residues in Fp, then |A|p/8+o(p).
  • (2)
    If A is both sum-free and satisfies A=A, then |A|p/9+o(p).
  • (3)
    If |A|loglogplogpp, then |A+A|(1+o(1))min(2|A|p,p).
Here the constants 1/8, 1/9, 2 are the best possible. Proofs make use of wrappers, subsets of a finite abelian group G, which ‘wrap’ popular values in convolutions of dense sets A,BG. These objects carry certain structural features, making them capable of addressing additive-combinatorial and enumerative problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Number Theory
Journal of Number Theory 数学-数学
CiteScore
1.30
自引率
14.30%
发文量
122
审稿时长
16 weeks
期刊介绍: The Journal of Number Theory (JNT) features selected research articles that represent the broad spectrum of interest in contemporary number theory and allied areas. A valuable resource for mathematicians, the journal provides an international forum for the publication of original research in this field. The Journal of Number Theory is encouraging submissions of quality, long articles where most or all of the technical details are included. The journal now considers and welcomes also papers in Computational Number Theory. Starting in May 2019, JNT will have a new format with 3 sections: JNT Prime targets (possibly very long with complete proofs) high impact papers. Articles published in this section will be granted 1 year promotional open access. JNT General Section is for shorter papers. We particularly encourage submission from junior researchers. Every attempt will be made to expedite the review process for such submissions. Computational JNT . This section aims to provide a forum to disseminate contributions which make significant use of computer calculations to derive novel number theoretic results. There will be an online repository where supplementary codes and data can be stored.
×
引用
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学术官方微信