<p>We show an improved quantitative lower bound for the size of the sumsets of sets containing no non-trivial <i>k</i>-term arithmetic progressions for <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1157_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(k\ge 4\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>≥</mo> <mn>4</mn> </mrow> </math></EquationSource> </InlineEquation>.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A note on sumsets of progression-free sets

  • Tomasz Schoen

摘要

We show an improved quantitative lower bound for the size of the sumsets of sets containing no non-trivial k-term arithmetic progressions for \(k\ge 4\) k 4 .