Splitting full matrix algebras over algebraic number fields.
DOI10.1016/j.jalgebra.2012.01.008zbMath1286.16041arXiv1106.6191OpenAlexW2963065034MaRDI QIDQ448406
Josef Schicho, Lajos Rónyai, Gábor Ivanyos
Publication date: 6 September 2012
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.6191
descent on elliptic curvessplittingscentral simple algebrasmaximal ordersparametrizationscomplex embeddingslattice bases reductionsMinkowski theorem on convex bodiespolynomial time ff-algorithmsreal embeddingsSeveri-Brauer surfacessplitting elements
Symbolic computation and algebraic computation (68W30) Endomorphism rings; matrix rings (16S50) Number-theoretic algorithms; complexity (11Y16) Finite-dimensional division rings (16K20) Computational aspects of associative rings (general theory) (16Z05) Other algebras and orders, and their zeta and (L)-functions (11R54)
Related Items (15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Recognition of division algebras.
- Factoring polynomials with rational coefficients
- Finding the radical of matrix algebras using Fitting decompositions
- Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
- Finding the radical of an algebra of linear transformations
- Efficient decomposition of separable algebras.
- Lattice basis reduction for indefinite forms and an application
- Efficient decomposition of associative algebras over finite fields
- Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
- Trivializing a central simple algebra of degree 4 over the rational numbers.
- A Lie algebra method for rational parametrization of Severi-Brauer surfaces.
- Computing the structure of finite algebras
- How to compute the Wedderburn decomposition of a finite-dimensional associative algebra
- Division Algebras and Wireless Communication
- Integer Programming with a Fixed Number of Variables
- Trading GRH for algebra: Algorithms for factoring polynomials and related structures
- Explicit n-descent on elliptic curves, II. Geometry
- Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)
- Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
- Zero divisors in quaternion algebras
- 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
- Efficient solution of rational conics
- On the Densest MIMO Lattices From Cyclic Division Algebras
- Explicit n-descent on elliptic curves, I. Algebra
This page was built for publication: Splitting full matrix algebras over algebraic number fields.