{"title":"关于几乎所有版本的巴洛格-塞梅雷迪-高尔斯定理","authors":"X. Shao","doi":"10.19086/DA.9095","DOIUrl":null,"url":null,"abstract":"We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemer\\'{e}di-Gowers theorem: For any $K\\geq 1$ and $\\varepsilon > 0$, there exists $\\delta = \\delta(K,\\varepsilon)>0$ such that the following statement holds: if $|A+_{\\Gamma}A| \\leq K|A|$ for some $\\Gamma \\geq (1-\\delta)|A|^2$, then there is a subset $A' \\subset A$ with $|A'| \\geq (1-\\varepsilon)|A|$ such that $|A'+A'| \\leq |A+_{\\Gamma}A| + \\varepsilon |A|$. We also discuss issues around quantitative bounds in this statement, in particular showing that when $A \\subset \\mathbb{Z}$ the dependence of $\\delta$ on $\\epsilon$ cannot be polynomial for any fixed $K>2$.","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2018-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On an almost all version of the Balog-Szemeredi-Gowers theorem\",\"authors\":\"X. Shao\",\"doi\":\"10.19086/DA.9095\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemer\\\\'{e}di-Gowers theorem: For any $K\\\\geq 1$ and $\\\\varepsilon > 0$, there exists $\\\\delta = \\\\delta(K,\\\\varepsilon)>0$ such that the following statement holds: if $|A+_{\\\\Gamma}A| \\\\leq K|A|$ for some $\\\\Gamma \\\\geq (1-\\\\delta)|A|^2$, then there is a subset $A' \\\\subset A$ with $|A'| \\\\geq (1-\\\\varepsilon)|A|$ such that $|A'+A'| \\\\leq |A+_{\\\\Gamma}A| + \\\\varepsilon |A|$. We also discuss issues around quantitative bounds in this statement, in particular showing that when $A \\\\subset \\\\mathbb{Z}$ the dependence of $\\\\delta$ on $\\\\epsilon$ cannot be polynomial for any fixed $K>2$.\",\"PeriodicalId\":37312,\"journal\":{\"name\":\"Discrete Analysis\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2018-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Analysis\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.19086/DA.9095\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.19086/DA.9095","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
On an almost all version of the Balog-Szemeredi-Gowers theorem
We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemer\'{e}di-Gowers theorem: For any $K\geq 1$ and $\varepsilon > 0$, there exists $\delta = \delta(K,\varepsilon)>0$ such that the following statement holds: if $|A+_{\Gamma}A| \leq K|A|$ for some $\Gamma \geq (1-\delta)|A|^2$, then there is a subset $A' \subset A$ with $|A'| \geq (1-\varepsilon)|A|$ such that $|A'+A'| \leq |A+_{\Gamma}A| + \varepsilon |A|$. We also discuss issues around quantitative bounds in this statement, in particular showing that when $A \subset \mathbb{Z}$ the dependence of $\delta$ on $\epsilon$ cannot be polynomial for any fixed $K>2$.
期刊介绍:
Discrete Analysis is a mathematical journal that aims to publish articles that are analytical in flavour but that also have an impact on the study of discrete structures. The areas covered include (all or parts of) harmonic analysis, ergodic theory, topological dynamics, growth in groups, analytic number theory, additive combinatorics, combinatorial number theory, extremal and probabilistic combinatorics, combinatorial geometry, convexity, metric geometry, and theoretical computer science. As a rough guideline, we are looking for papers that are likely to be of genuine interest to the editors of the journal.