一类被内部块隐藏的MSTD集的推广
Generalizations of a Curious Family of MSTD Sets Hidden By Interior Blocks
摘要:
如果$|A+A|>|A-A|$,则集合$A$是MSTD(和大于差)或和显性,如果$|A\hat{+}A|>|A-A|$,则集合$A$是RSD(限制和显性),其中$A\hat{+}A$是$A$中不同元素的和的集合。我们研究了一个有趣的家庭MSTD集已经出现了很多次在文献中(见作品Hegarty,马丁和O 'Bryant,和Penman和韦尔斯)。虽然这些集合乍一看似乎是临时的,但以正确的方式看待它们会揭示出一个很好的共同结构。特别是,我们不是把它们看作是明确写出来的集合,而是按照两个连续数字之间的差以递增的顺序来写它们。我们用$\mathcal{F}$表示这个族,并研究了它的许多性质。使用$\mathcal{F}$,我们能够产生许多集$A$与高值的$\log|A+A|/\log|A-A|$,构造集$A$与固定的$|A+A|-|A-A|$比以前的作者更经济,并提高了下限的比例RSD子集的$\{0,1,2,\dots,n-1\}$约$10^{-25}$(以前的最佳界是$10^{-37}$)。最后,通过计算机穷举搜索,我们找到了6个具有基数$15$的RSD集,这比迄今为止发现的最小基数低一个,并且发现$30$是RSD集的最小直径。
英文摘要:
A set $A$ is MSTD (more-sum-than-difference) or sum-dominant if $|A+A|>|A-A|$, and is RSD (restricted-sum dominant) if $|A\hat{+}A|>|A-A|$, where $A\hat{+}A$ is the set of sums of distinct elements in $A$. We study an interesting family of MSTD sets that have appeared many times in the literature (see the works of Hegarty, Martin and O'Bryant, and Penman and Wells). While these sets seem at first glance to be ad hoc, looking at them in the right way reveals a nice common structure. In particular, instead of viewing them as explicitly written sets, we write them in terms of differences between two consecutive numbers in increasing order. We denote this family by $\mathcal{F}$ and investigate many of its properties. Using $\mathcal{F}$, we are able to generate many sets $A$ with high value of $\log|A+A|/\log|A-A|$, construct sets $A$ with a fixed $|A+A|-|A-A|$ more economically than previous authors, and improve the lower bound on the proportion of RSD subsets of $\{0,1,2,\dots,n-1\}$ to about $10^{-25}$ (the previous best bound was $10^{-37}$). Lastly, by exhaustive computer search, we find six RSD sets with cardinality $15$, which is one lower than the smallest cardinality found to date, and find that $30$ is the smallest diameter of RSD sets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。