Explicit isomorphisms of quaternion algebras over quadratic global fields
T\'imea Csah\'ok, P\'eter Kutas, Micka\"el Montessinos, Gergely, Z\'abr\'adi

TL;DR
This paper introduces efficient algorithms for determining isomorphisms between quaternion algebras over quadratic extensions of global fields, utilizing corestriction and ideal computations.
Contribution
It presents novel algorithms leveraging corestriction and ideal computations to explicitly find isomorphisms of quaternion algebras over quadratic global fields.
Findings
Algorithms successfully compute isomorphisms in tested cases.
Method improves efficiency over previous approaches.
Applicable to quadratic extensions of both $\\mathbb{Q}$ and finite fields.
Abstract
Let be a separable quadratic extension of either or . We propose efficient algorithms for finding isomorphisms between quaternion algebras over . Our techniques are based on computing maximal one-sided ideals of the corestriction of a central simple -algebra.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Geometry · Polynomial and algebraic computation · Advanced Topics in Algebra
