Brauer-Thrall for totally reflexive modules

Mathematics – Commutative Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Final version; 34 pp. To appear in J. Algebra

Scientific paper

Let R be a commutative noetherian local ring that is not Gorenstein. It is known that the category of totally reflexive modules over R is representation infinite, provided that it contains a non-free module. The main goal of this paper is to understand how complex the category of totally reflexive modules can be in this situation. Local rings (R,m) with m^3=0 are commonly regarded as the structurally simplest rings to admit diverse categorical and homological characteristics. For such rings we obtain conclusive results about the category of totally reflexive modules, modeled on the Brauer-Thrall conjectures. Starting from a non-free cyclic totally reflexive module, we construct a family of indecomposable totally reflexive R-modules that contains, for every n in N, a module that is minimally generated by n elements. Moreover, if the residue field R/m is algebraically closed, then we construct for every n in N an infinite family of indecomposable and pairwise non-isomorphic totally reflexive R-modules, that are all minimally generated by n elements. The modules in both families have periodic minimal free resolutions of period at most 2.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Brauer-Thrall for totally reflexive modules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Brauer-Thrall for totally reflexive modules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Brauer-Thrall for totally reflexive modules will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-583996

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.