MMS 猜想的熵类比
An entropic analogue of the MMS conjecture
AI总结:
本文证明了从总和为零的多重集中无放回抽取k个元素的和的香农熵至少为伯努利分布熵,作为MMS猜想的熵类比。
摘要:
设 $P=\{x_1,\ldots,x_n\}$ 是由 $n\ge 2$ 个实数构成的多重集,满足 $\sum_{i=1}^{n}x_i=0$ 且 $\sum_{i=1}^{n}|x_i|>0$,并设 $k < n$ 为正整数。我们从 $P$ 中无放回地抽取 $k$ 个元素,并令 $X_P$ 为样本中元素之和。证明 $X_P$ 的香农熵满足 \[ \mathbf{H}(X_P) \ge \mathbf{H}(\text{Ber}(k/n)) \, , \] 其中 $\text{Ber}(k/n)$ 是均值为 $k/n$ 的伯努利随机变量。该结果是紧的,可视为 Manickam-Miklós-Singhi (MMS) 猜想的熵类比。
英文摘要:
Let $P=\{x_1,\ldots,x_n\}$ be a multiset consisting of $n\ge 2$ real numbers such that $\sum_{i=1}^{n}x_i=0$ and $\sum_{i=1}^{n}|x_i|>0$, and let $k <n$ be a positive integer. We sample $k$ elements from $P$ without replacement and set $X_P$ be the sum of the elements in our sample. It is shown that the Shannon entropy of $X_P$ satisfies \[ \mathbf{H}(X_P) \ge \mathbf{H}(\text{Ber}(k/n)) \, , \] where $\text{Ber}(k/n)$ is a Bernoulli random variable of mean $k/n$. The result is sharp, and may be seen as an entropic analogue of the Manickam-Miklós-Singhi (MMS) conjecture.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。