# Computing Explicit Isomorphisms with Full Matrix Algebras over Fq(x)

Ivanyos, Gábor and Kutas, Péter and Rónyai, Lajos
(2018)
*Computing Explicit Isomorphisms with Full Matrix Algebras over Fq(x).*
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 18 (2).
pp. 381-397.
ISSN 1615-3375
10.1007/s10208-017-9343-2

Text
Ivanyos_381_3220042_ny.pdf Download (224kB) |

## Abstract

We propose a polynomial time f-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over (Formula presented.)) for computing an isomorphism (if there is any) of a finite-dimensional (Formula presented.)-algebra (Formula presented.) given by structure constants with the algebra of n by n matrices with entries from (Formula presented.). The method is based on computing a finite (Formula presented.)-subalgebra of (Formula presented.) which is the intersection of a maximal (Formula presented.)-order and a maximal R-order, where R is the subring of (Formula presented.) consisting of fractions of polynomials with denominator having degree not less than that of the numerator. © 2017 SFoCM

Item Type: | Article |
---|---|

Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |

Divisions: | Informatics Laboratory |

SWORD Depositor: | MTMT Injector |

Depositing User: | MTMT Injector |

Date Deposited: | 08 Jan 2019 10:10 |

Last Modified: | 08 Jan 2019 10:10 |

URI: | http://eprints.sztaki.hu/id/eprint/9544 |

Update Item |