跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20804 · v1

A Recursive Construction of Perfect Arrays of Every Shape $2^{a_1}\times\cdots\times2^{a_d}$ over the Unit Quaternions

首次提交 2026-11-16 17:50
版本更新 2026-11-16 17:50
雷达观测 2026-11-17 17:11
arXiv ↗PDF ↗

摘要

We extend the recursive construction of perfect and odd perfect sequences over the simple unit quaternions $\Qe=\{\pm1,\pm i,\pm j,\pm k\}$ of Blake to arrays of any dimension. The three operations of that construction act on one direction of an array at a time, and are valid whenever the array is periodic in the remaining directions. Starting from a perfect array PP of shape M2×⋯×MdM_2\times\cdots\times M_d they give perfect arrays of shape 2a×M2×⋯×Md2^a\times M_2\times\cdots\times M_d for every a≥0a\ge0, with explicit index functions and with the array orthogonality property for the divisor 22 in the lifted direction; from a=5a=5 on these arrays are, in general, Kronecker products of a sequence with PP in neither order. Applied direction by direction, the construction gives perfect arrays over $\Qe$ in every shape 2a1×⋯×2ad2^{a_1}\times\cdots\times2^{a_d}, and in every shape 2a1×⋯×2ad−1×N2^{a_1}\times\cdots\times2^{a_{d-1}}\times N for which a perfect sequence of length NN over $\Qe$ exists. The contrast with the binary alphabet is sharp: a perfect binary array of shape 2a1×⋯×2ad2^{a_1}\times\cdots\times2^{a_d} exists only when ∑ak\sum a_k is even and max⁡ak≤12∑ak+1\max a_k\le\frac12\sum a_k+1, by a theorem of Jedwab and Kraemer on Menon difference sets in abelian 22-groups, whereas over $\Qe$ there is no constraint on the shape. We also show that, unlike the one-dimensional case, single arrays carrying a non-central twist do exist in two dimensions, and determine where the one-dimensional non-existence argument breaks.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 17:50 · 最新观测版本

A Recursive Construction of Perfect Arrays of Every Shape $2^{a_1}\times\cdots\times2^{a_d}$ over the Unit Quaternions

We extend the recursive construction of perfect and odd perfect sequences over the simple unit quaternions $\Qe=\{\pm1,\pm i,\pm j,\pm k\}$ of Blake to arrays of any dimension. The three operations of that construction act on one direction of an array at a time, and are valid whenever the array is periodic in the remaining directions. Starting from a perfect array PP of shape M2×⋯×MdM_2\times\cdots\times M_d they give perfect arrays of shape 2a×M2×⋯×Md2^a\times M_2\times\cdots\times M_d for every a≥0a\ge0, with explicit index functions and with the array orthogonality property for the divisor 22 in the lifted direction; from a=5a=5 on these arrays are, in general, Kronecker products of a sequence with PP in neither order. Applied direction by direction, the construction gives perfect arrays over $\Qe$ in every shape 2a1×⋯×2ad2^{a_1}\times\cdots\times2^{a_d}, and in every shape 2a1×⋯×2ad−1×N2^{a_1}\times\cdots\times2^{a_{d-1}}\times N for which a perfect sequence of length NN over $\Qe$ exists. The contrast with the binary alphabet is sharp: a perfect binary array of shape 2a1×⋯×2ad2^{a_1}\times\cdots\times2^{a_d} exists only when ∑ak\sum a_k is even and max⁡ak≤12∑ak+1\max a_k\le\frac12\sum a_k+1, by a theorem of Jedwab and Kraemer on Menon difference sets in abelian 22-groups, whereas over $\Qe$ there is no constraint on the shape. We also show that, unlike the one-dimensional case, single arrays carrying a non-central twist do exist in two dimensions, and determine where the one-dimensional non-existence argument breaks.

查看此版本解读 →查看此版本原文 ↗