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

查找和计数MSTD集

Finding and Counting MSTD sets

Geoffrey Iyer, Oleg Lazarev, Steven J. Miller, Liyang Zhang

摘要:

我们回顾了基本理论的总和比差异(MSTD)集,特别是它们的存在,简单的建设无限的家庭,证明了一个积极的百分比下的统一二项式模型集是MSTD,但不是如果每个元素被选择的概率趋于零,和“明确”的建设大家庭的MSTD集。最后,我们得出了一些新的结构和结果的广义MSTD集,包括在其他项目的结果,一个积极的百分比集有一个给定的线性组合大于另一个线性组合,并证明了一个积极的百分比集是$k$ -代和显性(即$A$,$A+A$,$...$,$kA = A + ...+A$是每个和显性)。

英文摘要:

We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their existence, simple constructions of infinite families, the proof that a positive percentage of sets under the uniform binomial model are MSTD but not if the probability that each element is chosen tends to zero, and 'explicit' constructions of large families of MSTD sets. We conclude with some new constructions and results of generalized MSTD sets, including among other items results on a positive percentage of sets having a given linear combination greater than another linear combination, and a proof that a positive percentage of sets are $k$-generational sum-dominant (meaning $A$, $A+A$, $...$, $kA = A + ...+A$ are each sum-dominant).

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

↑