Skip to main content
SpringerLink
Log in

Lower bounds for algebraic complexity of nilpotent associative algebras

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

Exact algebraic algorithms for calculating the product of two elements of nilpotent associative algebras over fields of characteristic zero are considered (this is a particular case of simultaneous calculation of several multinomials). The complexity of an algebra in this computational model is defined as the number of nonscalar multiplications of an optimal algorithm. Lower bounds for the tensor rank of nilpotent associative algebras (in terms of dimensions of certain subalgebras) are obtained, which give lower bounds for the algebraic complexity of this class of algebras. Examples of reaching these estimates for different dimensions of nilpotent algebras are presented.

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. A. Alder and V. Strassen, “On the algorithmic complexity of the associative algebras,” Theor. Comput. Sci., 15, 201–211 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  2. V. N. Latyshev, Combinatorial Ring Theory. Standard Bases [in Russian], Izd. Mosk. Univ. (1988).

  3. A. V. Leont’ev, “Lower bounds for algebraic complexity of classical simple Lie algebras,” Mat. Sb., 199, No. 5, 27–34 (2008).

    MathSciNet  Google Scholar 

  4. S. A. Zhoshina, “On the multiplicative complexity of Lie algebras,” Moscow Univ. Math. Bull., 45, No. 4, 45–46 (1990).

    MathSciNet  MATH  Google Scholar 

  5. S. A. Zhoshina, “On the multiplicative complexity of simple Lie algebras G 2, F 4, E 6, E 7, E 8 and of semisimple Lie algebras,” Moscow Univ. Math. Bull., 48, No. 4, 34–36 (1993).

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Program Systems of the Russian Academy of Sciences, Moscow, Russia

    A. V. Leont’ev

Authors
  1. A. V. Leont’ev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Leont’ev.

Additional information

Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 15, No. 7, pp. 127–136, 2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Leont’ev, A.V. Lower bounds for algebraic complexity of nilpotent associative algebras. J Math Sci 169, 644–650 (2010). https://doi.org/10.1007/s10958-010-0065-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-010-0065-0

Keywords

Search

Navigation