Efficient decomposition of associative algebras

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient decomposition of associative algebras

Full text

Pdf (1.17 MB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1996 international symposium on Symbolic and algebraic computation table of contents

Zurich, Switzerland

Pages: 170 - 178

Year of Publication: 1996

ISBN:0-89791-796-0

Authors

W. Eberly	Department of Computer Science, University of Calgary, Calgary, Alberta, Canada, T2N 1N4
M. Giesbrecht	Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada, R3T 2N2

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 14, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/236869.236931 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	E. R. Berlekamp. Factoring polynomials over large finite fields. Math. Comp. 24, pp. 713-735, 1970.
	2	Don Coppersmith , Shmuel Winograd, Matrix multiplication via arithmetic progressions, Journal of Symbolic Computation, v.9 n.3, p.251-280, March 1990 [doi>10.1016/S0747-7171(08)80013-2]
	3	W. Eberly. Decompositions of algebras over finite fields and number fields. Computational Complexity 1, pp. 179-206, 1991.
	4	K Friedl , L Rónyai, Polynomial time solutions of some problems of computational algebra, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.153-162, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22162]
	5	Patrizia M. Gianni , Victor Miller , Barry M. Trager, Decomposition of Algebras, Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation, p.300-308, July 04-08, 1988
	6	Mark Giesbrecht, Nearly Optimal Algorithms For Canonical Matrix Forms, SIAM Journal on Computing, v.24 n.5, p.948-969, Oct. 1995 [doi>10.1137/S0097539793252687]
	7	D. F. Holt and S. l~ees. Testing modules for irreducibility. J. Australian Mathematical Society 57, pp. 1-16, 1994.
	8	N. Jacobson. Structure of Rings, vol. 37. American Math. Soc. Colloquium Publ. (Providence, USA), 1956.
	9	S. Landau. Factoring polynomials over algebraic number fields. SIAM J. Comput. 14, pp. 184-195, 1985.
	10	Gerhard O. Michler, Some problems in computational representation theory, Journal of Symbolic Computation, v.9 n.5-6, p.571-582, May/June 1990 [doi>10.1016/S0747-7171(08)80074-0]
	11	E. Noether. Hyperkomplexe GrSssen und Darstellungstheorie. Math. Zeit. 30, pp. 641-692, 1929
	12	R. A. Parker. The computer calculation of modular characters (the meat-axe). In Computational Group Theory: Proceedings of the London Mathematical Society Symposium on Computational Group Theory, pp. 267-274, London, 1984. Academic Press.
	13	B. O. Peirce. Linear associative algebra. American Journal of Mathematics 4, pp. 97-229, 1881.
	14	R. Pierce. Associative Algebras. Springer-Verlag (Heidelberg), 1982.
	15	L. Ronyai, Simple algebras are difficult, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.398-408, January 1987, New York, New York, United States [doi>10.1145/28395.28438]
	16	Lajos Rónyai, Computing the structure of finite algebras, Journal of Symbolic Computation, v.9 n.3, p.355-373, March 1990 [doi>10.1016/S0747-7171(08)80017-X]
	17	L. R6nyai. Algorithmic properties of maximal orders in simple algebras over (~. Computational Complexity 2, pp. 225-243, 1992.
	18	Gerhard J. A. Schneider, Computing with endomorphism rings of modular representations, Journal of Symbolic Computation, v.9 n.5-6, p.607-636, May/June 1990 [doi>10.1016/S0747-7171(08)80078-8]
	19	A. SchSnhage. Schnelle Multiplikation von Polynomen fiber KSrpern der Chaxakteristik 2. Acta Informatica 7, pp. 395-398, 1977.
	20	A. SchSnhage and V. Strassen. Schnelle Multiplikation grof~er Zahlen. Computing 7, pp. 281-292, 1971.
	21	J. H. M. Wedderburn. On hypercomplex numbers. Proc. London Math. Soc. 6(2), pp. 77-118, 1907.

CITED BY 2

	Gábor Ivanyos, Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract), Proceedings of the 2000 international symposium on Symbolic and algebraic computation, p.175-183, July 2000, St. Andrews, Scotland
	W. Eberly , M. Giesbrecht, Efficient decomposition of separable algebras, Journal of Symbolic Computation, v.37 n.1, p.35-81, January 2004