Skip to main content
SpringerLink
Log in

The algorithmic structure of \(\mathfrak{s}\mathfrak{l}(2,k)\)

  • Conference paper
  • First Online:
Algebraic Algorithms and Error-Correcting Codes (AAECC 1985)

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

  • 163 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. GOTO/F.D. GROSSHANS, Semisimple Lie Algebras, M. Dekker, New York & Basel 1978.

    Google Scholar 

  2. H.F. de GROOTE, On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping, Theor. Computer Science 7 (1978), 1–24.

    Google Scholar 

  3. H.F. de GROOTE, On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for 2 × 2-matrix multiplication, Theor. Computer Science 7 (1978), 127–148.

    Google Scholar 

  4. H.F. de GROOTE, Lectures on the complexity of bilinear problems (to be published).

    Google Scholar 

  5. H.F. de GROOTE/J. HEINTZ, A lower bound for the bilinear complexity of some semisimple Lie algebras, in: Proc. of the AAECC-3 Conference (Grenoble 1985), this volume.

    Google Scholar 

  6. J.E. HUMPHREYS, Introduction to Lie Algebras and Representation Theory, GTM 9, Springer, New York 1972.

    Google Scholar 

  7. J.C. LAFON, Complexité d'évaluation de plusieurs formes bilinéaires et des principaus calculs matriciels, Partie B, Université Grenoble 1976.

    Google Scholar 

  8. R. MIRWALD, Die algorithmische Struktur der sr(2, k), Master's Thesis, Universität Frankfurt a.M. 1985.

    Google Scholar 

  9. V. STRASSEN, Vermeidung von Divisionen, Crelles J. f. reine und angew. Math. 264 (1973), 238–251.

    Google Scholar 

  10. S. WINOGRAD, Some bilinear forms whose multiplicative complexity depends on the field of constants, Math. Systems Theory 10 (1977), 169–180.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, J.W. Goethe-Universität, Frankfurt a.M.

    Roland Mirwald

Authors
  1. Roland Mirwald
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Calmet

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mirwald, R. (1986). The algorithmic structure of \(\mathfrak{s}\mathfrak{l}(2,k)\) . In: Calmet, J. (eds) Algebraic Algorithms and Error-Correcting Codes. AAECC 1985. Lecture Notes in Computer Science, vol 229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16776-5_730

Download citation

  • DOI: https://doi.org/10.1007/3-540-16776-5_730

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16776-1

  • Online ISBN: 978-3-540-39855-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation