有限域上Costas阵列的奇偶性
Parity properties of Costas arrays defined via finite fields
摘要:
$n$阶科斯塔斯阵列是将点和空白排列成$n$行和$n$列,每行和每列中正好有一个点,该排列满足某些特定条件。如果出现在第$i$行和第$j$列中,则出现在这种阵列中的点是偶/偶的,其中$i$和$j$都是偶整数,并且存在奇/奇、偶/奇和奇/偶点的类似定义。可以使用有限域定义两种类型的Costas阵列,称为Golomb-Costas阵列和Welch-Costas阵列。当$q$是奇素数的幂时,我们枚举Golomb-Costas阵列中的偶/偶奇/奇,偶/奇和奇/偶点的数量。我们表明,这些数字中的三个是相等的,他们从第四个不同的$\pm 1$。对于一个Welch-Costas阵列的顺序$p-1$,其中$p$是一个奇素数,上述四个数字都等于$(p-1)/4$时$p\equiv 1\pmod{4}$,但当$p\equiv 3\pmod{4}$,我们表明,这四个数字定义的类数的虚二次域$\mathbb{Q}(\sqrt{-p})$,从而表现在一个更不可预测的方式。
英文摘要:
A Costas array of order $n$ is an arrangement of dots and blanks into $n$ rows and $n$ columns, with exactly one dot in each row and each column, the arrangement satisfying certain specified conditions. A dot occurring in such an array is even/even if it occurs in the $i$-th row and $j$-th column, where $i$ and $j$ are both even integers, and there are similar definitions of odd/odd, even/odd and odd/even dots. Two types of Costas arrays, known as Golomb-Costas and Welch-Costas arrays, can be defined using finite fields. When $q$ is a power of an odd prime, we enumerate the number of even/even odd/odd, even/odd and odd/even dots in a Golomb-Costas array. We show that three of these numbers are equal and they differ by $\pm 1$ from the fourth. For a Welch-Costas array of order $p-1$, where $p$ is an odd prime, the four numbers above are all equal to $(p-1)/4$ when $p\equiv 1\pmod{4}$, but when $p\equiv 3\pmod{4}$, we show that the four numbers are defined in terms of the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{-p})$, and thus behave in a much less predictable manner.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。