Improved algorithms for splitting full matrix algebras.
From MaRDI portal
(Redirected from Publication:4929077)
Abstract: Let be an algebraic number field of degree and discriminant over . Let be an associative algebra over given by structure constants such that holds for some positive integer . Suppose that , and are bounded. In a previous paper a polynomial time ff-algorithm was given to construct explicitly an isomorphism . Here we simplify and improve this algorithm in the cases , , and , with or . The improvements are based on work by Y. Kitaoka and R. Coulangeon on tensor products of lattices.
Recommendations
- Splitting full matrix algebras over algebraic number fields.
- Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
- Trivializing a central simple algebra of degree 4 over the rational numbers.
- Computation of lattice isomorphisms and the integral matrix similarity problem
- Recognition of division algebras.
Cited in
(9)- Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
- Explicit isomorphisms of quaternion algebras over quadratic global fields
- Splitting quaternion algebras over quadratic number fields
- Trivializing a central simple algebra of degree 4 over the rational numbers.
- A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q
- Splitting full matrix algebras over algebraic number fields.
- scientific article; zbMATH DE number 1569143 (Why is no real title available?)
- Efficient computations in central simple algebras using Amitsur cohomology
- Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\)
This page was built for publication: Improved algorithms for splitting full matrix algebras.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4929077)