跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1085新增论文
+884其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 06:59 · 全站最近入库:2026-11-19 06:59各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-19 06:59最近发现新增版本:2026-11-19 06:59库内论文最新更新时间:2026-11-18 08:00

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

26,871 已收录论文22,375 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

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

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 06:57(北京时间)
版本更新 · v3arXiv:2609.11588

Quasilinear multiplication in the Cayley-Dickson tower

Harrison Lemley

原文摘要

Direct evaluation of the defining product of the Cayley-Dickson algebra $A_n$ of rank $N:=2^n$ over a unital commutative ring $R$ requires a quadratic number of arithmetic operations. This paper gives a uniform bilinear algorithm for multiplication in this algebra when $2 \in R^\times$, costing $O(N \log N)$ arithmetic operations in $R$ and $O(N)$ auxiliary storage when the doubling parameters of $A_n$ are units whose square roots lie in a fixed commutative coefficient algebra $S$ finitely generated as an $R$-module and admitting an $R$-linear map $π\colon S \to R$ with $π(1) = 1$. In particular, the algorithm applies to every Cayley-Dickson tower over $\mathbb{R}$ and finite fields $\mathbb{F}_q$ of odd characteristic, and the tensor rank of multiplication in $A_n$ over these fields is at most $(36n-69)2^{n-3}+10$ when $n\ge4$. To the author's knowledge, the algorithm presented in this paper is the first uniform subquadratic algorithm for multiplication in $A_n$. An implementation for the standard tower over $\mathbb{R}$, $\mathbb{C}$, and $\mathbb{F}_q$ for $q = p^k$ with $p \le 2^{31}-1$ an odd prime and $k \le 12$ is available in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface pyfastcd, available on PyPI. In single-core benchmarks against direct multiplication and the uniform Cariow-Cariowa method over $\mathbb{R}$, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$ for both single and batched products and was over $17$ times faster than direct multiplication.

math.RA · cs.SC · math.NA