Skip to main content
SpringerLink
Log in

Computing Cartan subalgebras of Lie algebras

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fields and algebraic number fields. We present a deterministic polynomial time algorithm for the case when the ground fieldk is sufficiently large. Our method is based on a solution of a linear algebra problem: the task of finding a locally regular element in a subspace of linear transformations. Also, we give a polynomial time algorithm for restricted Lie algebras over arbitrary finite fields. Both methods require an auxiliary procedure for finding non-nilpotent elements in subalgebras. This problem is also treated. Computational experiences are discussed at the end of the paper.

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

Access this article

Log in via an institution

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. Beck, R. E., Kolman, B., Stewart, I. N.: Computing the structure of a Lie algebra. Computers in Non-associative Rings and Algebras. Academic Press, New York, 1977

    Google Scholar 

  2. Belinfante, J. G. F., Kolman, B.: A Survey of Lie Groups and Lie Algebras with Applications and Computational Methods, SIAM, 1990

  3. Hopcroft, J. E., Ullman, J. D.: Introduction to automata theory, languages and computation. Addison-Wesley 1979

  4. Humphreys, J. E.: Introduction to Lie Algebras and Representation Theory. Springer New York, Heidelberg, Berlin, 1972

    Google Scholar 

  5. Jacobson, N.: Lie Algebras. Dover, New York, 1979

    Google Scholar 

  6. Rand, D., Winternitz, P., Zassenhaus, H.: On the Identification of a Lie Algebra Given by its Structure Constants. I. Direct Decompositions, Levy Decompositions, and Nilradicals Linear Algebra and its Applications109, 197–246 (1988)

    Google Scholar 

  7. Rónyai, L.: Computing the structure of finite algebras. J Symbolic Computat,9, 355–373 (1990)

    Google Scholar 

  8. Rónyai, L.: Computations in Associative Algebras. In: Groups and Computation, DIMACS Series, 11, Am Math Soc 221–243 (1993)

  9. Schwartz, J. T.: Fast probabilistic algorithms for verification of polynomial identities. J ACM27, 701–717 (1980)

    Google Scholar 

  10. Winter, D. J.: Abstract Lie Algebras. The MIT Press, 1972

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Technical University of Eindhoven, P.O.Box 513, 5600, MB Eindhoven, The Netherlands

    Willem De Graaf

  2. Computer and Automation Institute, Hungarian Academy of Sciences, Lágymányosi u. 11, 1111, Budapest, Hungary

    Gábor Ivanyos

  3. Computer and Automation Institute, Hungarian Academy of Sciences, Lagymanyosi u. 11, 1111, Budapest, Hungary

    Lajos Rónyai

Authors
  1. Willem De Graaf
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gábor Ivanyos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lajos Rónyai
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by Hungarian National Foundation for Scientific Research grants T016503 and F4116

Rights and permissions

Reprints and permissions

About this article

Cite this article

De Graaf, W., Ivanyos, G. & Rónyai, L. Computing Cartan subalgebras of Lie algebras. AAECC 7, 339–349 (1996). https://doi.org/10.1007/BF01293593

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01293593

Search

Navigation