A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q

DOI10.1006/JAGM.1994.1002MaRDI QIDQ4289839zbMATH OpenOpenAlexFDO

Authors Lajos Rónyai

Publication date 4 September 1994

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1994.1002

zbMATH Keywords

algebraic number fieldcentral simple algebrapolynomial time algorithmsplitting elementsplitting field

Mathematics Subject Classification ID

Cyclotomic extensions (11R18) Algebraic number theory computations (11Y40) Finite-dimensional division rings (16K20) Computational aspects of associative rings (general theory) (16Z05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1569143
• Trivializing a central simple algebra of degree 4 over the rational numbers.
• Improved algorithms for splitting full matrix algebras.
• Splitting full matrix algebras over algebraic number fields.

Cited in

(8)

• Trivializing a central simple algebra of degree 4 over the rational numbers.
• A splitting field relating to Turing machines.
• Splitting full matrix algebras over algebraic number fields.
• Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
• scientific article; zbMATH DE number 1569143 (Why is no real title available?)
• From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces
• Determinant Equivalence Test over Finite Fields and over Q
• Efficient computations in central simple algebras using Amitsur cohomology

This page was built for publication: A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289839)