Skip to main content
Log in

Algorithms for Commutative Algebras Over the Rational Numbers

  • Published:
Foundations of Computational Mathematics Aims and scope Submit manuscript

Abstract

The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an algebra, determine its nilradical, all of its prime ideals, as well as the corresponding localizations and residue class fields, its largest separable subalgebra, and its primitive idempotents. We also solve the discrete logarithm problem in the multiplicative group of the algebra. While deterministic polynomial-time algorithms were known earlier, our approach is different from previous ones. One of our tools is a primitive element algorithm; it decides whether the algebra has a primitive element and, if so, finds one, all in polynomial time. A methodological novelty is the use of derivations to replace a Hensel–Newton iteration. It leads to an explicit formula for lifting idempotents against nilpotents that is valid in any commutative ring.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Babai, R. Beals, J-y. Cai, G. Ivanyos, and E. M. Luks, Multiplicative equations over commuting matrices, in Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Atlanta, GA, 1996), ACM, New York, 1996, 498–507.

  2. D. Eisenbud, Commutative algebra with a view toward algebraic geometry, Graduate Texts in Mathematics 150, Springer-Verlag, New York, 1995.

    Google Scholar 

  3. K. Friedl and L. Rónyai, Polynomial time solutions of some problems of computational algebra, in Proceedings of the seventeenth annual ACM symposium on Theory of computing, ACM, 1985, 153–162.

  4. J. von zur Gathen and J. Gerhard, Modern computer algebra. Third edition. Cambridge University Press, Cambridge, 2013.

  5. G. Ge, Algorithms related to multiplicative representations of algebraic numbers, PhD thesis, U.C. Berkeley, 1993.

  6. P. Gianni, V. Miller, and B. Trager, Decomposition of algebras, in Symbolic and algebraic computation (Rome, 1988), Lect. Notes in Comp. Sci. 358, Springer, Berlin, 1989, 300–308.

    MATH  Google Scholar 

  7. G. H. Hardy and E. M. Wright, An introduction to the theory of numbers. Fifth edition. The Clarendon Press, Oxford University Press, New York, 1979.

  8. R. Hartshorne, Algebraic geometry. Graduate Texts in Mathematics No. 52, Springer-Verlag, New York-Heidelberg, 1977.

    Article  MathSciNet  MATH  Google Scholar 

  9. G. Ivanyos, L. Rónyai, and A. Szántó, Decomposition of algebras over \({\mathbb{F}}_q(X_1,\ldots ,X_m)\), Appl. Algebra Engrg. Comm. Comput. 5, 1994, 71–90.

  10. A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515–534.

  11. H. W. Lenstra, Jr., Lattices, in Algorithmic number theory: lattices, number fields, curves and cryptography, Math. Sci. Res. Inst. Publ. 44, Cambridge Univ. Press, Cambridge, 2008, 127–181, http://library.msri.org/books/Book44/files/06hwl.pdf.

  12. H. W. Lenstra, Jr. and A. Silverberg, Revisiting the Gentry-Szydlo Algorithm, in Advances in Cryptology—CRYPTO 2014, Lect. Notes in Comp. Sci. 8616, Springer, Berlin, 2014, 280–296.

  13. H. W. Lenstra, Jr. and A. Silverberg, Lattices with symmetry, Journal of Cryptology (2016), doi:10.1007/s00145-016-9235-7.

  14. H. W. Lenstra, Jr. and A. Silverberg, Roots of unity in orders, Foundations of Computational Mathematics (2016), doi:10.1007/s10208-016-9304-1.

Download references

Acknowledgments

We thank the referee for helpful comments, and especially for pointing out that a number of results were known earlier, in [1, 3, 6, 9].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. Silverberg.

Additional information

Communicated by John Cremona.

Support for the research was provided by the Alfred P. Sloan Foundation.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lenstra, H.W., Silverberg, A. Algorithms for Commutative Algebras Over the Rational Numbers. Found Comput Math 18, 159–180 (2018). https://doi.org/10.1007/s10208-016-9336-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10208-016-9336-6

Keywords

Mathematics Subject Classification

Navigation