arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.07068math.COmath.NTmath.PR
收藏

离散集的贪心算法

The Greedy Algorithm for Dissociated Sets

Sayan Dutta

AI总结:

本文研究了离散集的贪心算法,证明了该算法总能翻倍,并给出了相关集合的构造和性质。

摘要:

一个集合$\mathcal S\subset \mathbb N$被称为子集和不同的或离散的,如果其所有有限子集的和都不同。等价地,如果形式为$$\sum_{s\in \mathcal S} \varepsilon_s \cdot s =0$$其中$\varepsilon_s \in \{-1,0,+1\}$的等式成立,则所有$\varepsilon_s$都为0。对于离散集$\mathcal S$,我们证明对于$c_\ast = \frac 12 \log_2 \left(\frac π2\right)$和任何$c_\ast-1<C<c_\ast$,我们有$$\mathcal S(n) \,:=\, \mathcal S\cap [1,n] \,\le\, \log_2 n +\frac 12 \log_2\log_2 n + C$$对于所有$n\in \mathcal N_C$,其渐近密度$\mathbf d\left(\mathcal N_C\right)=2-2^{c_\ast-C}$。进一步,我们考虑生成这些集合的贪心算法,并证明该算法总是最终翻倍。最后,我们还考虑了离散集的一些推广,并证明了关于它们的类似结果。

英文摘要:

A set $\mathcal S\subset \mathbb N$ is said to be a subset-sum-distinct or dissociated if all of its finite subsets have different sums. Alternately, an equivalent classification is if any equality of the form $$\sum_{s\in \mathcal S} \varepsilon_s \cdot s =0$$ where $\varepsilon_s \in \{-1,0,+1\}$ implies that all the $\varepsilon_s$'s are $0$. For a dissociated set $\mathcal S$, we prove that for $c_\ast = \frac 12 \log_2 \left(\frac π2\right)$ and any $c_\ast-1<C<c_\ast$, we have $$\mathcal S(n) \,:=\, \mathcal S\cap [1,n] \,\le\, \log_2 n +\frac 12 \log_2\log_2 n + C$$ for all $n\in \mathcal N_C$ with asymptotic density $\mathbf d\left(\mathcal N_C\right)=2-2^{c_\ast-C}$. Further, we consider the greedy algorithm for generating these sets and prove that this algorithm always eventually doubles. Finally, we also consider some generalizations of dissociated sets and prove similar results about them.

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

↑