A Conjectured Heat Flow Problem (M. S. Klamkin)
A Conjectured Heat Flow Problem (M. S. Klamkin)
复制标题
推测的热流问题 (M. S. Klamkin)
DOI：
10.1137/1037014
复制
发表时间：
1995
期刊：
影响因子：
--
通讯作者：
B. Kawohl
中科院分区：
文献类型：
--
作者：
R. Gulliver;N. Willms;B. Kawohl
问题（a）是由构造码公式访问加法器通道引起的。目前，和-相异集似乎是设计这些码的唯一方法。这种关系在[3]中描述。当前的一个猜想是存在一个绝对常数c使得对于（k，+）中的每个和-不同集X，XI< c+ log 2k。如果这个猜想是正确的，对（a）的肯定回答会令人吃惊。与（B）有关的一个结果是：（2n 1，+）中的（n+ 1）元和-相异集的个数至少为（32/）-12n，124].
Problem (a) is motivated by construction of codes formultiple-access adder channels. At present, sum-distinct sets seem to be the only way to design these codes. This relationship is described in [3]. A current conjecture is that there exists an absolute constant c such that XI< c+ log2 k for every sum-distinct set X in (k,+). If the conjecture is correct, an affirmative answer to (a) would come as a surprise. A result related to (b) is that the number of (n+ 1)-element sum-distinct sets in (2n 1,+) is at least (32/)-12n,[4].