Skip to main content

Decomposition of algebras

  • Algebraic Geometry
  • Conference paper
  • First Online:
Symbolic and Algebraic Computation (ISSAC 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 358))

Included in the following conference series:

Abstract

In this paper we deal with the problem of decomposing finite communtative Q-algebras as a direct product of local Q-algebras. We solve this problem by reducing it to the problem of finding a decomposition of finite algebras over finite field. We will show that it is possible to define a lifting process that allows to reconstruct the answer over the rational numbers. This lifting appears to be very efficient since it is a quadratic lifting that doesn't require stepwise inversions. It is easy to see that the Berlekamp-Hensel algorithm for the factorization of polynomials is a special case of this argument.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. A. Abbott and J. H. Davenport. A remark on a paper by Wang: Another surprising property of 42. Math. Comp., 51:837–839, 1988.

    Google Scholar 

  2. Michael F. Atiyah and Ian G. McDonald. Introduction to Commutative Algebra. Addison-Wesley, Reading, 1969.

    Google Scholar 

  3. Elwyn R. Berlekamp. Factoring polynomials over finite fields. Bell System Technical J., 46:1853–1859, 1967.

    Google Scholar 

  4. Elwyn R. Berlekamp. Factoring polynomials over large finite fields. Math. Comp., 24:713–735, 1970.

    Google Scholar 

  5. Paul F. Camion. Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials. IEEE Trans. Inform. Theory, IT-29(3):378–385, 1983.

    Google Scholar 

  6. Donald E. Knuth. The Art of Computer Programming, volume 2, Seminumerical Algorithms. Addison-Wesley, Reading, 1973.

    Google Scholar 

  7. Serge Lang. Algebra. Addison-Wesley, Reading, 1965.

    Google Scholar 

  8. Daniel Lazard. On polynomial factorization. In Jacques Calmet, editor, EUROCAM '82, volume 144 of Lecture Notes in Computer Science, pages 126–134. Springer-Verlag, 1983.

    Google Scholar 

  9. Arjen K. Lenstra, Hendrik W. Lenstra, and Laszlo Lovasz. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515–534, 1982.

    Google Scholar 

  10. Kurt Mahler. An inequality for the discriminant of a polynomial. Michigan Math. Journal, 11:257–262, 1964.

    Google Scholar 

  11. Victor S. Miller. Factoring with idempotents. Unpublished Manuscript, Harvard University, 1973.

    Google Scholar 

  12. Hans Zassenhaus. On Hensel factorization, I. Journal of Number Theory, 1:291–311, 1969.

    Google Scholar 

  13. Hans Zassenhaus. A remark on the Hensel factorization method. Math. Comp., 32:287–292, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

P. Gianni

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gianni, P., Miller, V., Trager, B. (1989). Decomposition of algebras. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-51084-2_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51084-0

  • Online ISBN: 978-3-540-46153-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics