Abstract
We consider the boolean complexity of the decomposition of matrix algebras over ℂ and ℝ with bases consisting of matrices over a number field. Deterministic polynomial time algorithms for the decomposition of semi-simple algebras over these fields and Las Vegas polynomial time algorithms for the decomposition of simple algebras are obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Babai andL. Rónyai, Computing irreducible representations of finite groups,Math. Comp. 55 (1990), 705–722.
G. E. Collins andR. Loos, Real zeroes of polynomials, inComputer Algebra, Symbolic and Algebraic Computation, Second Edition, Springer-Verlag, New York, 1983, 83–94.
C. W. Curtis andI. Reiner,Representation Theory of Finite Groups and Associative Algebras, Wiley, New York, 1962.
W. Eberly,Computations for algebras and group representations, Department of Computer Science Technical Report 225/89, University of Toronto, 1989.
W. Eberly Decompositions of algebras over finite fields and number fields,Computational Complexity 1 (1991), 183–210.
K. Friedl and L. Rónyai, Polynomial time solutions for some problems in computational algebra, inProc. 17th Ann. Symp. Theory of Computing, 1985, 153–162.
J. Gabriel, New methods for reduction of group representations using an extension of Schur's lemma,J. Math. Phys. 5 (1964), 494–504.
J. Gabriel, New methods for reduction of group representations II,J. Math. Phys. 9 (1968), 973–976.
J. Gabriel, New methods for reduction of group representations III,J. Math. Phys. 10 (1969), 1789–1795.
J. Gabriel, New methods for reduction of group representations IV,J. Math. Phys. 10 (1969), 1932–1934.
J. Gabriel, Numerical methods for reduction of group representations, inProc. 2nd ACM Symp. Symbolic and Algebraic Manipulation, 1971, 180–182.
S. Landau, Factoring polynomials over algebraic number fields,SIAM J. Comput. 14 (1985), 184–196.
R. Loos, Computing in algebraic extensions, inComputer Algebra, Symbolic and Algebraic Computation, Second Edition, Springer-Verlag, New York, 1983, 173–187.
R. S. Pierce,Associative Algebras, Springer-Verlag, New York, 1982.
J. R. Pinkert, An exact method for finding the roots of a complex polynomial,ACM Transactions on Mathematical Software 2 (1976), 351–363.
L. Rónyai, Simple algebras are difficult, inProc. 19th Ann. Symp. Theory of Computing, 1987, 398–408.
L. Rónyai, Zero divisors in quaternion algebras,Journal of Algorithms 9 (1988), 494–506.
L. Rónyai, Algorithmic properties of maximal orders in simple algebras overℚ,Computational Complexity, to appear.
A. Schönhage, The fundamental theorem of algebra in terms of computational complexity, Technical Report, Universität Tübingen, 1982.
B. L. van der Waerden,Algebra, Volume 1, Frederick Ungar, New York, 1970.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Eberly, W. Decompositions of algebras over ℝ and ℂ. Comput Complexity 1, 211–234 (1991). https://doi.org/10.1007/BF01200061
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01200061