Splitting full matrix algebras over algebraic number fields

Let K be a fixed algebraic number field and let A be an associative algebra over K given by structure constants such that A≅Mn(K) holds for some positive integer n. Suppose that n is bounded. Then an isomorphism A→Mn(K) can be constructed by a polynomial time ff-algorithm. An ff-algorithm is a deter...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of algebra Jg. 354; H. 1; S. 211 - 223
Hauptverfasser:	Ivanyos, Gábor, Rónyai, Lajos, Schicho, Josef
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 15.03.2012
Schlagworte:	Central simple algebra Lattice basis reduction Maximal order Minkowskiʼs theorem on convex bodies n-Descent on elliptic curves Parametrization Real and complex embedding Severi–Brauer surfaces Splitting Splitting element Parametrization Splitting Central simple algebra Splitting element Real and complex embedding Minkowskiʼs theorem on convex bodies Lattice basis reduction n-Descent on elliptic curves Severi–Brauer surfaces Maximal order
ISSN:	0021-8693, 1090-266X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Let K be a fixed algebraic number field and let A be an associative algebra over K given by structure constants such that A≅Mn(K) holds for some positive integer n. Suppose that n is bounded. Then an isomorphism A→Mn(K) can be constructed by a polynomial time ff-algorithm. An ff-algorithm is a deterministic procedure which is allowed to call oracles for factoring integers and factoring univariate polynomials over finite fields. As a consequence, we obtain a polynomial time ff-algorithm to compute isomorphisms of central simple algebras of bounded degree over K.
ISSN:	0021-8693 1090-266X
DOI:	10.1016/j.jalgebra.2012.01.008