当前位置: X-MOL 学术arXiv.cs.SC › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Algorithmic applications of the corestriction of central simple algebras
arXiv - CS - Symbolic Computation Pub Date : 2020-07-14 , DOI: arxiv-2007.06981
T\'imea Csah\'ok, P\'eter Kutas, Gergely Z\'abr\'adi

Let $L$ be a separable quadratic extension of either $\mathbb{Q}$ or $\mathbb{F}_q(t)$. We propose efficient algorithms for finding isomorphisms between quaternion algebras over $L$. Our techniques are based on computing maximal one-sided ideals of the corestriction of a central simple $L$-algebra. In order to obtain efficient algorithms in the characteristic 2 case, we propose an algorithm for finding nontrivial zeros of a regular quadratic form in four variables over $\mathbb{F}_{2^k}(t)$

中文翻译:

中心简单代数的共限制的算法应用

令 $L$ 是 $\mathbb{Q}$ 或 $\mathbb{F}_q(t)$ 的可分离二次扩展。我们提出了在 $L$ 上寻找四元数代数之间同构的有效算法。我们的技术基于计算中心简单 $L$-代数的核心限制的最大单边理想。为了在特征2情况下获得有效的算法,我们提出了一种算法,用于在$\mathbb{F}_{2^k}(t)$上的四个变量中寻找正则二次形式的非平凡零点
更新日期:2020-10-02
down
wechat
bug