Minimal projective resolutions

  • Green E
  • Solberg Ø
  • Zacharia D
42Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we present an algorithmic method for computing a projective resolution of a module over an algebra over a field. If the algebra is finite dimensional, and the module is finitely generated, we have a computational way of obtaining a minimal projective resolution, maps included. This resolution turns out to be a graded resolution if our algebra and module are graded. We apply this resolution to the study of the Ext \operatorname {Ext} -algebra of the algebra; namely, we present a new method for computing Yoneda products using the constructions of the resolutions. We also use our resolution to prove a case of the “no loop” conjecture.

Cite

CITATION STYLE

APA

Green, E., Solberg, Ø., & Zacharia, D. (2001). Minimal projective resolutions. Transactions of the American Mathematical Society, 353(7), 2915–2939. https://doi.org/10.1090/s0002-9947-01-02687-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free