Abstract
We consider the algorithmic problem of constructing a maximal order in a semisimple algebra over an algebraic number field. A polynomial time ff-algorithm is presented to solve the problem. (An ffalgorithm is a deterministic method which is allowed to call oracles for factoring integers and for factoring polynomials over finite fields. The cost of a call is the size of the input given to the oracle.) As an application, we give a method to compute the degrees of the irreducible representations over an algebraic number fieldK of a finite groupG, in time polynomial in the discriminant of the defining polynomial ofK and the size of a multiplication table ofG.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. R. Berlekamp, Factoring polynomials over finite fields.Bell System Technical Journal 46 (1967), 1853–1859.
W. M. Eberly, Decompositions of algebras overR andC.Computational Complexity 1 (1991), 207–230.
K. Friedl, L. Rónyai, Polynomial time solutions of some problems in computational algebra.Proc. 17th ACM STOC, Providence, Rhode Island, 1985, 153–162.
M. Harada, Hereditary orders.Trans. Amer. Math. Soc. 107 (1963), 273–290.
H. Jacobinski, Two remarks about hereditary orders.Proc. Amer. Math. Soc. 28 (1971), 1–8.
M. E. Pohst, Three principal tasks of computational algebraic number theory.Number theory and applications, Proc. NATO Advanced Study Inst., Kluwer Academic Publishers, 1989, 123–133.
I. Reiner,Maximal orders. Academic Press, 1975.
L. Rónyai, Computing the structure of finite algebras.Journal of Symbolic Computation 9 (1990), 355–373.
L. Rónyai, Algorithmic properties of maximal orders in simple algebras overQ.Computational Complexity 2 (1992), 225–243.
L. Rónyai, A deterministic method for computing splitting elements in simple algebras overQ. 1993, accepted for publication inJournal of Algorithms.
H. Zassenhaus, Ein Algorithmus zur Berechnung einer Minimalbasis über gegebener Ordnung.Funktionalanalysis, Birkhäuser, 1967, 90–103.