arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1003.1454math.CO
收藏

关于基序列猜想

On the base sequence conjecture

Dragomir Z. Djokovic

摘要:

令BS(m,n)表示基序列(A;B;C;D)的集合,其中A和B的长度为m,C和D的长度为n。基本序列猜想(BSC)断言BS(n+1,n)存在(即,不为空)。这对于n <= 36和n是Golay数时是正确的。我们证明了对于n=37和n=38也是如此。值得指出的是,BSC比著名的Hadamard矩阵猜想更强。为了证明碱基序列的丰富性,我们之前已经将图Gamma_n附加到BS(n+1,n),并且计算了n <= 27时的Gamma_n。现在我们扩展这些计算并确定Gamma_n(n=28,.,35.我们还提出了一个猜想描述这些图一般。

英文摘要:

Let BS(m,n) denote the set of base sequences (A;B;C;D), with A and B of length m and C and D of length n. The base sequence conjecture (BSC) asserts that BS(n+1,n) exist (i.e., are non-empty) for all n. This is known to be true for n <= 36 and when n is a Golay number. We show that it is also true for n=37 and n=38. It is worth pointing out that BSC is stronger than the famous Hadamard matrix conjecture. In order to demonstrate the abundance of base sequences, we have previously attached to BS(n+1,n) a graph Gamma_n and computed the Gamma_n for n <= 27. We now extend these computations and determine the Gamma_n for n=28,...,35. We also propose a conjecture describing these graphs in general.

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

↑