arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.1332math.CO
收藏

包装Costas阵列

Packing Costas Arrays

J. H. Dinitz, P. R. J. Ostergard, D. R. Stinson

摘要:

n阶Costas拉丁方是一组n个相同阶的不相交Costas数组。本文从构造和分类的角度对科斯塔斯拉丁方进行了研究。一个完整的分类进行了27阶。在此范围内,我们验证了对任意奇数阶n >= 3不存在Costas拉丁方的猜想。各种其他相关的组合结构也被认为是,包括近Costas拉丁方(这是近Costas阵列的某些包装)和梵蒂冈Costas广场。

英文摘要:

A Costas latin square of order n is a set of n disjoint Costas arrays of the same order. Costas latin squares are studied here from a construction as well as a classification point of view. A complete classification is carried out up to order 27. In this range, we verify the conjecture that there is no Costas latin square for any odd order n >= 3. Various other related combinatorial structures are also considered, including near Costas latin squares (which are certain packings of near Costas arrays) and Vatican Costas squares.

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

↑