Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
From MaRDI portal
Publication:1750386
DOI10.1007/s10208-017-9343-2zbMath1391.16032arXiv1508.07755OpenAlexW2963009281MaRDI QIDQ1750386
Gábor Ivanyos, Lajos Rónyai, Péter Kutas
Publication date: 18 May 2018
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.07755
function fieldpolynomial time algorithmmaximal orderfull matrix algebralattice basis reductionexplicit isomorphism
Symbolic computation and algebraic computation (68W30) Endomorphism rings; matrix rings (16S50) Computational aspects of associative rings (general theory) (16Z05)
Related Items
Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\) ⋮ Primitive idempotents in central simple algebras over \(\mathbb{F}_q(t)\) with an application to coding theory ⋮ An identification system based on the explicit isomorphism problem ⋮ Splitting quaternion algebras over quadratic number fields ⋮ Explicit isomorphisms of quaternion algebras over quadratic global fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Splitting full matrix algebras over algebraic number fields.
- Factoring multivariate polynomials over finite fields
- Arithmétique des algèbres de quaternions
- Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
- Decomposition of algebras over \(F_ q(X_ 1,\dots,X_ m)\)
- Computing Levi decompositions in Lie algebras
- Computing the structure of finite algebras
- Trading GRH for algebra: Algorithms for factoring polynomials and related structures
- Explicit n-descent on elliptic curves, II. Geometry
- Cyclic Convolutional Codes over Separable Extensions
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Improved algorithms for splitting full matrix algebras
- Explicit n-descent on elliptic curves, I. Algebra
- Explicit $n$-descent on elliptic curves III. Algorithms
