Skip to main content
Log in

The kiev algorithm for bocses applies directly to representation-finite algebras

  • Published:
manuscripta mathematica Aims and scope Submit manuscript

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.

References

  1. W.W. Crawley-Boevey,“On tame algebras and bocses”, Proc. London Math. Soc. (3) 56 (1988),451–483.

    Google Scholar 

  2. Yu A. Drozd, “Tame and wild matrix problems”,Springer Lect. Notes in Math., 832 (1980),242–258.

    Google Scholar 

  3. L. Miranda, “Fundamentos de la Teoría de representaciones de bimódulos sobre categorías”.Tesis de Maestría UNAM (1988).

  4. A.V. Roiter, “Matrix problems and representations of BOCS's”,Springer Lect. Notes in Math., 831 (1980),288–324.

    Google Scholar 

  5. A.V. Roiter and M.M. Kleiner, “Representations of Differential Graded Categories”,Springer Lect. Notes in Math., 488 (1975),316–339.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bautista, R., Salmerón, L. The kiev algorithm for bocses applies directly to representation-finite algebras. Manuscripta Math 65, 281–287 (1989). https://doi.org/10.1007/BF01303038

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation