arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.4902math.COmath.NT
收藏

关于(Z_2)^n中生成集的和

On Sums of Generating Sets in (Z_2)^n

Chaim Even-Zohar

摘要:

设A和B是(Z_2)^n的两个仿射生成集。通常,我们用A+B表示它们的闵可夫斯基和。给定A和B的基数,A+B能有多小?我们对这个问题给出一个严格的回答。当A和B都是(Z_2)^n的某个子群的陪集的并时,得到了我们的界.这些陪集被排列成汉明球,其中较小的一个半径为1。用类似的方法,我们重新证明了(Z_2)^n中的Freiman-Ruzsa定理,并给出了一个最优的上界.用F(K)表示最大生成常数|<A>|A+A|/ |A| &lt; K。|/ |A| &lt; K.我们明确地计算了F(K),特别是证明了4^K / 4K &lt; F(K)(1+o(1))&lt; 4^K / 2K。这改进了最近由Green和Tao以及Konyagin发现的估计F(K)= poly(K)4^K。

英文摘要:

Let A and B be two affinely generating sets of (Z_2)^n. As usual, we denote their Minkowski sum by A+B. How small can A+B be, given the cardinalities of A and B? We give a tight answer to this question. Our bound is attained when both A and B are unions of cosets of a certain subgroup of (Z_2)^n. These cosets are arranged as Hamming balls, the smaller of which has radius 1. By similar methods, we re-prove the Freiman-Ruzsa theorem in (Z_2)^n, with an optimal upper bound. Denote by F(K) the maximal spanning constant |<A>|/|A|, over all subsets A of (Z_2)^n with doubling constant |A+A|/|A| < K. We explicitly calculate F(K), and in particular show that 4^K / 4K < F(K) (1+o(1)) < 4^K / 2K. This improves the estimate F(K) = poly(K) 4^K, found recently by Green and Tao and by Konyagin.

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

↑