Paperlane

no. 16 · Tuesday 17 November 2026

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

Sam Blake

math.IT

Abstract

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$.

fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.19627 ↗