arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.05473math.COcs.ITmath.IT
收藏

科斯塔斯立方体

Costas cubes

Jonathan Jedwab, Lily Yen

摘要:

Costas数组是一个置换数组,其中连接$1$对的向量都是不同的。我们提出了一个新的三维组合对象相关的Costas阵列:一个顺序$n$ Costas立方体是一个阵列$(d_{i,j,k})$的大小$n \times n \times n$在$\mathbb{Z}_2$的三个投影到二维,即$(\sum_i d_{i,j,k})$和$(\sum_j d_{i,j,k})$和$(\sum_k d_{i,j,k})$,是一个顺序$n$ Costas阵列。我们确定所有的Costas立方体的顺序最多$29$,表明Costas立方体存在的所有这些订单,除了$18$和$19$和一个显着比例的Costas阵列的某些订单发生的Costas立方体的投影。然后,我们提出了四个无限家庭的Costas立方体的建设。

英文摘要:

A Costas array is a permutation array for which the vectors joining pairs of $1$s are all distinct. We propose a new three-dimensional combinatorial object related to Costas arrays: an order $n$ Costas cube is an array $(d_{i,j,k})$ of size $n \times n \times n$ over $\mathbb{Z}_2$ for which each of the three projections of the array onto two dimensions, namely $(\sum_i d_{i,j,k})$ and $(\sum_j d_{i,j,k})$ and $(\sum_k d_{i,j,k})$, is an order $n$ Costas array. We determine all Costas cubes of order at most $29$, showing that Costas cubes exist for all these orders except $18$ and $19$ and that a significant proportion of the Costas arrays of certain orders occur as projections of Costas cubes. We then present constructions for four infinite families of Costas cubes.

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

↑