{"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)}$n1/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.
期刊介绍:
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.