Sharp Bound for the Erdős–Straus Non-averaging Set Problem

IF 2.2 1区 数学 Q1 MATHEMATICS
Huy Tuan Pham, Dmitrii Zakharov
{"title":"Sharp Bound for the Erdős–Straus Non-averaging Set Problem","authors":"Huy Tuan Pham, Dmitrii Zakharov","doi":"10.1007/s00039-025-00728-8","DOIUrl":null,"url":null,"abstract":"A set of integers <jats:inline-formula> <jats:alternatives> <jats:tex-math>$A$</jats:tex-math> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>A</mml:mi> </mml:math> </jats:alternatives> </jats:inline-formula> is <jats:italic>non-averaging</jats:italic> if there is no element <jats:inline-formula> <jats:alternatives> <jats:tex-math>$a$</jats:tex-math> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>a</mml:mi> </mml:math> </jats:alternatives> </jats:inline-formula> in <jats:inline-formula> <jats:alternatives> <jats:tex-math>$A$</jats:tex-math> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>A</mml:mi> </mml:math> </jats:alternatives> </jats:inline-formula> which can be written as an average of a subset of <jats:inline-formula> <jats:alternatives> <jats:tex-math>$A$</jats:tex-math> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>A</mml:mi> </mml:math> </jats:alternatives> </jats:inline-formula> not containing <jats:inline-formula> <jats:alternatives> <jats:tex-math>$a$</jats:tex-math> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>a</mml:mi> </mml:math> </jats:alternatives> </jats:inline-formula> . We show that the largest non-averaging subset of <jats:inline-formula> <jats:alternatives> <jats:tex-math>$\\{1, \\ldots , n\\}$</jats:tex-math> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mo>{</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mo>…</mml:mo> <mml:mo>,</mml:mo> <mml:mi>n</mml:mi> <mml:mo>}</mml:mo> </mml:math> </jats:alternatives> </jats:inline-formula> has size <jats:inline-formula> <jats:alternatives> <jats:tex-math>$n^{1/4+o(1)}$</jats:tex-math> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:msup> <mml:mi>n</mml:mi> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>/</mml:mo> <mml:mn>4</mml:mn> <mml:mo>+</mml:mo> <mml:mi>o</mml:mi> <mml:mo>(</mml:mo> <mml:mn>1</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> </mml:msup> </mml:math> </jats:alternatives> </jats:inline-formula> , thus solving the Erdős–Straus problem. We also determine the largest size of a non-averaging set in a <jats:inline-formula> <jats:alternatives> <jats:tex-math>$d$</jats:tex-math> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>d</mml:mi> </mml:math> </jats:alternatives> </jats:inline-formula> -dimensional box for any fixed <jats:inline-formula> <jats:alternatives> <jats:tex-math>$d$</jats:tex-math> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>d</mml:mi> </mml:math> </jats:alternatives> </jats:inline-formula> . Our main tool includes the structure theorem for the set of subset sums due to Conlon, Fox and the first author, together with a result about the structure of a point set in nearly convex position.","PeriodicalId":12478,"journal":{"name":"Geometric and Functional Analysis","volume":"140 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2025-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Geometric and Functional Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00039-025-00728-8","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

A set of integers $A$ A is non-averaging if there is no element $a$ a in $A$ A which can be written as an average of a subset of $A$ A not containing $a$ a . We show that the largest non-averaging subset of $\{1, \ldots , n\}$ { 1 , … , n } has size $n^{1/4+o(1)}$ n 1 / 4 + o ( 1 ) , thus solving the Erdős–Straus problem. We also determine the largest size of a non-averaging set in a $d$ d -dimensional box for any fixed $d$ d . Our main tool includes the structure theorem for the set of subset sums due to Conlon, Fox and the first author, together with a result about the structure of a point set in nearly convex position.
Erdős-Straus非平均集问题的夏普界
一组整数$A$ A是非平均的,如果$A$ A$ A中没有元素$A$ A,它可以写成$A$ A的一个子集$A$ A不包含$A$ A的平均值。我们证明了$\{1,\ldots, n\}${1,…,n}的最大非平均子集的大小为$n^{1/4+o(1)}$ n 1/4+o(1),从而解决了Erdős-Straus问题。对于任意固定的d$ d,我们还确定了d$ d维盒子中非平均集的最大大小。我们的主要工具包括Conlon, Fox和第一作者的子集和集的结构定理,以及关于近凸位置点集结构的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.70
自引率
4.50%
发文量
34
审稿时长
6-12 weeks
期刊介绍: Geometric And Functional Analysis (GAFA) publishes original research papers of the highest quality on a broad range of mathematical topics related to geometry and analysis. GAFA scored in Scopus as best journal in "Geometry and Topology" since 2014 and as best journal in "Analysis" since 2016. Publishes major results on topics in geometry and analysis. Features papers which make connections between relevant fields and their applications to other areas.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书