Skip to main content

Improvements of the Alder—Strassen Bound: Algebras with Nonzero Radical

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2001)

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

Included in the following conference series:

Abstract

Let C(A) denote the multiplicative complexity of a finite dimensional associative k-algebra A.

For algebras A with nonzero radical radA, we exhibit several lower bound techniques for C(A) that yield bounds significantly above the Alder- Strassen bound. In particular, we prove that the multiplicative complexity of the multiplication in the algebras k[X 1,..., X n/I d+1 (X 1,..., X n) is bounded from below by \( 3. \left( \begin{gathered} n + d \hfill \\ n \hfill \\ \end{gathered} \right) - \left( \begin{gathered} n + \left[ {d/2} \right] \hfill \\ n \hfill \\ \end{gathered} \right) - \left( \begin{gathered} n + \left[ {d/2} \right] \hfill \\ n \hfill \\ \end{gathered} \right), \) where I d (X 1,..., X n) denotes the ideal generated by all monomials of degree d in X 1,...,X n. Furthermore, we show the lower bound C(T n (k) ≥ (2 1/8 - o(1)) dim Tn(k) for the multiplication of upper triangular matrices.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Alder and V. Strassen. On the algorithmic complexity of associative algebras. Theoret. Comput. Sci., 15:201–211, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  2. Markus Bläser. Bivariate polynomial multiplication. In Proc. 39th Ann. IEEE Symp. on Foundations of Comput. Sci. (FOCS), pages 186–191, 1998.

    Google Scholar 

  3. Markus Bläser. Lower bounds for the multiplicative complexity of matrix multiplication. Comput. Complexity, 8:203–226, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  4. Markus Bläser. Untere Schranken für den Rang assoziativer Algebren. Dissertation, Universität Bonn, 1999.

    Google Scholar 

  5. Markus Bläser. Lower bounds for the bilinear complexity of associative algebras. Comput. Complexity, 9:73–112, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  6. Markus Bläser. A 5/2n 2-lower bound for the multiplicative complexity of n×n-matrix multiplication. In Proc. 18th Int. GI-MIMD Symp. on Theoret. Aspects of Comput. Sci. (STACS), Lecture Notes in Comput. Sci. 2010, pages 99–110, 2001.

    Google Scholar 

  7. Werner Büchi. Über eine Klasse von Algebren minimalen Rangs. Dissertation, Universität Zürich, 1984.

    Google Scholar 

  8. Peter Bürgisser, Michael Clausen, and M. Amin Shokrollahi. Algebraic Complexity Theory. Springer, 1997.

    Google Scholar 

  9. Yurij A. Drozd and Vladimir V. Kirichenko. Finite Dimensional Algebras. Springer, 1994.

    Google Scholar 

  10. Hans F. de Groote. Lectures on the Complexity of Bilinear Problems. Lecture Notes in Comput. Science 245. Springer, 1986.

    Google Scholar 

  11. Joos Heintz and Jacques Morgenstern. On associative algebras of minimal rank. In Proc. 2nd Applied Algebra and Error Correcting Codes Conf. (AAECC), Lecture Notes in Comput. Sci. 228, pages 1–24. Springer, 1986.

    Google Scholar 

  12. Joseph Ja’Ja’. On the complexity of bilinear forms with commutativity. SIAM J. Comput., 9:717–738, 1980.

    MathSciNet  Google Scholar 

  13. Victor Ya. Pan. Methods for computing values of polynomials. Russ. Math. Surv., 21:105–136, 1966.

    Article  Google Scholar 

  14. Richard S. Pierce. Associative Algebras. Springer, 1982.

    Google Scholar 

  15. Volker Strassen. Vermeidung von Divisionen. J. Reine Angew. Math., 264:184–202, 1973.

    MATH  MathSciNet  Google Scholar 

  16. Volker Strassen. Algebraic complexity theory. In J. van Leeuven, editor, Handbook of Theoretical Computer Science Vol. A, pages 634–672. Elsevier Science Publishers B.V., 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bläser, M. (2001). Improvements of the Alder—Strassen Bound: Algebras with Nonzero Radical. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48224-5_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42287-7

  • Online ISBN: 978-3-540-48224-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics