跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 14:51 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 16:31 — 2026-11-22 16:31(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 14:51最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 14:49(北京时间)
新论文 · v1arXiv:2611.20804

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

Sam Blake

原文摘要

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 $P$ of shape $M_2\times\cdots\times M_d$ they give perfect arrays of shape $2^a\times M_2\times\cdots\times M_d$ for every $a\ge0$, with explicit index functions and with the array orthogonality property for the divisor $2$ in the lifted direction; from $a=5$ on these arrays are, in general, Kronecker products of a sequence with $P$ in neither order. Applied direction by direction, the construction gives perfect arrays over $\Qe$ in every shape $2^{a_1}\times\cdots\times2^{a_d}$, and in every shape $2^{a_1}\times\cdots\times2^{a_{d-1}}\times N$ for which a perfect sequence of length $N$ over $\Qe$ exists. The contrast with the binary alphabet is sharp: a perfect binary array of shape $2^{a_1}\times\cdots\times2^{a_d}$ exists only when $\sum a_k$ is even and $\max a_k\le\frac12\sum a_k+1$, by a theorem of Jedwab and Kraemer on Menon difference sets in abelian $2$-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.

cs.IT · math.CO

新论文 · v1arXiv:2611.19627

A Recursive Construction of Perfect and Odd Perfect Sequences of Unbounded Length over the Unit Quaternions

Sam Blake

原文摘要

We give a recursive construction, with closed-form index functions, of perfect and odd perfect periodic autocorrelation sequences over the eight simple unit quaternions $\Qe=\{\pm1,\pm i,\pm j,\pm k\}$ in every length $2^n$. The sequences are built, as in the recursive perfect array construction of Blake, from \emph{twisted periodic extensions}: a short sequence continued with period $M$ up to a right factor $u\in\Qe$. Over roots of unity the twists cannot be regenerated by a one-dimensional recursion, consistently with Mow's conjecture; over $\Qe$ we show that no single sequence of length $M\not\equiv0\pmod 4$ carries a twist $\pm i,\pm j$ or $\pm k$ either, but that \emph{pairs} of sequences whose $i$- and $(-i)$-twisted autocorrelations are complementary do. These $i$-pairs behave exactly like Golay pairs: they double under interleaving with a right factor $j$ in place of a sign, every Golay pair of length $n$ gives an $i$-pair of length $2n$, and they exist in length $6$ where no Golay pair exists. An $i$-pair of length $M$ interleaves to an odd perfect sequence of length $4M$, and a perfect and an odd perfect sequence of length $M$ interleave to a perfect sequence of length $4M$ with the array orthogonality property for the divisor $2$. The $i$-pairs of length $2^t$ are $x^{(t)}_{r,a}=j^{w_t(r,a)}$, where $w_t(r,a)$ counts the changes in the bit string formed by $r$ and the binary digits of $a$, and the odd perfect sequence of length $2^{t+2}$ is $y^{(t)}_{2a+r}=j^{w_t(r,\,a\bmod 2^t)}\, i^{(1-2r)\lfloor a/2^t\rfloor}$. The construction also gives odd perfect sequences over $\Qe$ in every length $24\cdot2^s$ and perfect sequences in every length $6\cdot4^s$.

cs.IT · math.CO