Splitting full matrix algebras over algebraic number fields.
parametrizationsmaximal orderssplittingscentral simple algebrascomplex embeddingsdescent on elliptic curveslattice bases reductionsMinkowski theorem on convex bodiespolynomial time ff-algorithmsreal embeddingsSeveri-Brauer surfacessplitting elements
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)
- 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
- scientific article; zbMATH DE number 3783206 (Why is no real title available?)
- scientific article; zbMATH DE number 3477356 (Why is no real title available?)
- scientific article; zbMATH DE number 1253966 (Why is no real title available?)
- scientific article; zbMATH DE number 1254290 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 1569143 (Why is no real title available?)
- scientific article; zbMATH DE number 799775 (Why is no real title available?)
- scientific article; zbMATH DE number 843465 (Why is no real title available?)
- scientific article; zbMATH DE number 3201718 (Why is no real title available?)
- scientific article; zbMATH DE number 3333393 (Why is no real title available?)
- A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q
- A Lie algebra method for rational parametrization of Severi-Brauer surfaces.
- Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
- Computing Irreducible Representations of Finite Groups
- Computing the structure of finite algebras
- Division algebras and wireless communication
- Efficient decomposition of associative algebras over finite fields
- Efficient decomposition of separable algebras.
- Efficient solution of rational conics
- Explicit n-descent on elliptic curves, I. Algebra
- Explicit n-descent on elliptic curves, II. Geometry
- Factoring polynomials with rational coefficients
- Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)
- Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
- Finding the radical of an algebra of linear transformations
- Finding the radical of matrix algebras using Fitting decompositions
- How to compute the Wedderburn decomposition of a finite-dimensional associative algebra.
- Integer Programming with a Fixed Number of Variables
- Lattice basis reduction for indefinite forms and an application
- On the Densest MIMO Lattices From Cyclic Division Algebras
- Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
- Recognition of division algebras.
- Solvability of norm equations over cyclic number fields of prime degree
- Solving quadratic equations using reduced unimodular quadratic forms
- Trading GRH for algebra: algorithms for factoring polynomials and related structures
- Trivializing a central simple algebra of degree 4 over the rational numbers.
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Zero divisors in quaternion algebras
- Determinant Equivalence Test over Finite Fields and over Q
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
- Splitting quaternion algebras over quadratic number fields
- Decomposition of algebras over finite fields and number fields
- Structure of the rational monoid algebra for Boolean matrices of order 3
- Improved algorithms for splitting full matrix algebras.
- A Prym variety with everywhere good reduction over \(\mathbb{Q}(\sqrt{61})\)
- Computation of lattice isomorphisms and the integral matrix similarity problem
- 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
- Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
- Computing the Cassels–Tate pairing on the 3-Selmer group of an elliptic curve
- Explicit $n$-descent on elliptic curves III. Algorithms
- Efficient computations in central simple algebras using Amitsur cohomology
- scientific article; zbMATH DE number 7559443 (Why is no real title available?)
- An identification system based on the explicit isomorphism problem
- Corestrictions of algebras and splitting fields
- Computing with real Lie algebras: real forms, Cartan decompositions, and Cartan subalgebras
- Tensor isomorphism by conjugacy of Lie algebras
- Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
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)