蜂窝阵列
Honeycomb arrays
摘要:
蜂窝阵列是一种类似于六角网格中的科斯塔斯阵列的阵列;它们首先由Golomb和Taylor在1984年研究。Blackburn、Etzion、Martin和Paterson最近的一个结果表明(与Costas阵列的情况相反),蜂窝阵列的例子只有200多个,尽管它们对蜂窝阵列的最大尺寸的限制太大,不允许对所有可能性进行穷举搜索。本文包含一个定理,大大限制了蜂窝阵列的可能性的数量(特别是,该定理意味着蜂窝阵列中的点的数量必须是奇数)。本文总结了蜂窝阵列的计算机搜索,并给出了两个新的15点蜂窝阵列的例子。
英文摘要:
A honeycomb array is an analogue of a Costas array in the hexagonal grid; they were first studied by Golomb and Taylor in 1984. A recent result of Blackburn, Etzion, Martin and Paterson has shown that (in contrast to the situation for Costas arrays) there are only finitely many examples of honeycomb arrays, though their bound on the maximal size of a honeycomb array is too large to permit an exhaustive search over all possibilities. The present paper contains a theorem that significantly limits the number of possibilities for a honeycomb array (in particular, the theorem implies that the number of dots in a honeycomb array must be odd). Computer searches for honeycomb arrays are summarised, and two new examples of honeycomb arrays with 15 dots are given.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。