Splitting full matrix algebras over algebraic number fields.

DOI10.1016/J.JALGEBRA.2012.01.008zbMATH Open1286.16041arXiv1106.6191OpenAlexW2963065034MaRDI QIDQ448406FDOQ448406

Authors: Gábor Ivanyos, Lajos Rónyai, Josef Schicho 

Publication date: 6 September 2012

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive integer n. Suppose that d, n and D are bounded. Then an isomorphism of A with M_n(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.

Full work available at URL: https://arxiv.org/abs/1106.6191

Recommendations

• Improved algorithms for splitting full matrix algebras.
• Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
• A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q
• Decomposition of algebras over finite fields and number fields
• Computation of lattice isomorphisms and the integral matrix similarity problem

zbMATH Keywords

parametrizationsmaximal orderssplittingscentral simple algebrascomplex embeddingsdescent on elliptic curveslattice bases reductionsMinkowski theorem on convex bodiespolynomial time ff-algorithmsreal embeddingsSeveri-Brauer surfacessplitting elements

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects of associative rings (general theory) (16Z05) Number-theoretic algorithms; complexity (11Y16) Finite-dimensional division rings (16K20) Endomorphism rings; matrix rings (16S50) Other algebras and orders, and their zeta and (L)-functions (11R54)

Cites Work

• Factoring polynomials with rational coefficients
• Integer Programming with a Fixed Number of Variables
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Explicit n-descent on elliptic curves, I. Algebra
• A Lie algebra method for rational parametrization of Severi-Brauer surfaces.
• Finding the radical of an algebra of linear transformations
• Efficient decomposition of associative algebras over finite fields
• Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)
• How to compute the Wedderburn decomposition of a finite-dimensional associative algebra.
• Finding the radical of matrix algebras using Fitting decompositions
• Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
• Efficient decomposition of separable algebras.
• Lattice basis reduction for indefinite forms and an application
• Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
• Trivializing a central simple algebra of degree 4 over the rational numbers.
• Computing the structure of finite algebras
• Division algebras and wireless communication
• Trading GRH for algebra: algorithms for factoring polynomials and related structures
• Explicit n-descent on elliptic curves, II. Geometry
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• Zero divisors in quaternion algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q
• Solving quadratic equations using reduced unimodular quadratic forms
• Computing Irreducible Representations of Finite Groups
• Solvability of norm equations over cyclic number fields of prime degree
• Title not available (Why is that?)
• Efficient solution of rational conics
• Title not available (Why is that?)
• On the Densest MIMO Lattices From Cyclic Division Algebras
• Recognition of division algebras.

Cited In (20)

• Explicit $n$-descent on elliptic curves III. Algorithms
• Title not available (Why is that?)
• Computing with real Lie algebras: real forms, Cartan decompositions, and Cartan subalgebras
• Structure of the rational monoid algebra for Boolean matrices of order 3
• Determinant Equivalence Test over Finite Fields and over Q
• Improved algorithms for splitting full matrix algebras.
• Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
• A Prym variety with everywhere good reduction over \(\mathbb{Q}(\sqrt{61})\)
• Decomposition of algebras over finite fields and number fields
• An identification system based on the explicit isomorphism problem
• Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
• Computing the Cassels–Tate pairing on the 3-Selmer group of an elliptic curve
• Computation of lattice isomorphisms and the integral matrix similarity problem
• Splitting quaternion algebras over quadratic number fields
• Tensor isomorphism by conjugacy of Lie algebras
• Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
• Efficient computations in central simple algebras using Amitsur cohomology
• Primitive idempotents in central simple algebras over \(\mathbb{F}_q(t)\) with an application to coding theory
• Explicit isomorphisms of quaternion algebras over quadratic global fields
• Corestrictions of algebras and splitting fields

This page was built for publication: Splitting full matrix algebras over algebraic number fields.

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