arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.03068math.CO
收藏

群中的避和集

Sum-avoiding sets in groups

Terence Tao, Van Vu

摘要:

令$A$是任意加法群$G$的有限子集,并且令$ϕ(A)$表示$A$中的最大子集$B$在$A$中是避免和的基数(也就是说,对于所有不同的$b_1,b_2 \in B$,$b_1+b_2 \not \in A$)。当$G$无扭转时,根据$ϕ(A)$控制$A$尺寸的问题由Erdens和Moser提出。当$G$有挠时,由于子群的存在,对于固定的$ϕ(A)$,$A$可以任意大。尽管如此,我们提供了一个定性的答案,在这种设置类似的Erdens-Moser问题,通过建立一个结构定理,粗略地说,断言$A$是有效地覆盖的$ϕ(A)$有限子群的$G$,或少于$ϕ(A)$有限子群的$G$连同一个剩余集的有界基数。为了避免大量的嵌套归纳论证,我们的证明使用了非标准分析的语言。我们还否定地回答了Erdens关于有限加性群$G$的大子集$A$与$ϕ(A)$有界的问题,但给出了一个积极的结果时,$|G|$是不可分的小素数。

英文摘要:

Let $A$ be a finite subset of an arbitrary additive group $G$, and let $ϕ(A)$ denote the cardinality of the largest subset $B$ in $A$ that is sum-avoiding in $A$ (that is to say, $b_1+b_2 \not \in A$ for all distinct $b_1,b_2 \in B$). The question of controlling the size of $A$ in terms of $ϕ(A)$ in the case when $G$ was torsion-free was posed by Erdős and Moser. When $G$ has torsion, $A$ can be arbitrarily large for fixed $ϕ(A)$ due to the presence of subgroups. Nevertheless, we provide a qualitative answer to an analogue of the Erdős-Moser problem in this setting, by establishing a structure theorem, which roughly speaking asserts that $A$ is either efficiently covered by $ϕ(A)$ finite subgroups of $G$, or by fewer than $ϕ(A)$ finite subgroups of $G$ together with a residual set of bounded cardinality. In order to avoid a large number of nested inductive arguments, our proof uses the language of nonstandard analysis. We also answer negatively a question of Erdős regarding large subsets $A$ of finite additive groups $G$ with $ϕ(A)$ bounded, but give a positive result when $|G|$ is not divisible by small primes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑