Skip Navigation

Bulletin of the London Mathematical Society 2001 33(1):41-51; doi:10.1112/blms/33.1.41
© 2001 by London Mathematical Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Eklof, P. C.
Right arrow Articles by Trlifaj, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© London Mathematical Society

How To Make Ext Vanish

Paul C. Eklof and Jan Trlifaj

Mathematics Department UCI, Irvine, CA 92697-3875, USA; e-mail: peklof{at}math.uci.edu
Katedra algebry MFF UK Sokolovská 83, 186 75 Prague 8, Czech Republic; e-mail: trlifaj{at}karlin.mff.cuni.cz

Received 19 February 1999. Revision received 5 February 2000.

We describe a general construction of a module A from a given module B such that Ext(B, A) = 0, and we apply it to answer several questions on splitters, cotorsion theories and saturated rings.

The first author acknowledges support from NSF grant DMS-9803126.

The second author acknowledges support by a Fulbright Scholarship at the Department of Mathematics, University of California at Irvine.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Bull. London Math. Soc.Home page
J. Stovicek and J. Trlifaj
All tilting modules are of countable type
Bull. London Math. Soc., February 1, 2007; 39(1): 121 - 132.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.