The stability of finite sets in dyadic groups

arXiv: Combinatorics(2020)

引用 0|浏览1
暂无评分
摘要
We show that there is an absolute $cu003e0$ such that any subset of $mathbb{F}_2^infty$ of size $N$ is $O(N^{1-c})$-stable in the sense of Terry and Wolf. By contrast a size $N$ arithmetic progression in the integers is not $N$-stable.
更多
查看译文
关键词
stability,order property,additive combinatorics,Ruzsa modelling,polynomial method
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要