The Existence of Maximal $n$-Orthogonal Subcategories

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages, to appear in Journal of Algebra

Scientific paper

10.1016/j.jalgebra.2009.01.036

For an $(n-1)$-Auslander algebra $\Lambda$ with global dimension $n$, we give some necessary conditions for $\Lambda$ admitting a maximal $(n-1)$-orthogonal subcategory in terms of the properties of simple $\Lambda$-modules with projective dimension $n-1$ or $n$. For an almost hereditary algebra $\Lambda$ with global dimension 2, we prove that $\Lambda$ admits a maximal 1-orthogonal subcategory if and only if for any non-projective indecomposable $\Lambda$-module $M$, $M$ is injective is equivalent to that the reduced grade of $M$ is equal to 2. We give a connection between the Gorenstein Symmetric Conjecture and the existence of maximal $n$-orthogonal subcategories of $^{\bot}T$ for a cotilting module $T$. For a Gorenstein algebra, we prove that all non-projective direct summands of a maximal $n$-orthogonal module are $\Omega ^n\tau$-periodic. In addition, we study the relation between the complexity of modules and the existence of maximal $n$-orthogonal subcategories for the tensor product of two finite-dimensional algebras.

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

The Existence of Maximal $n$-Orthogonal Subcategories 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 The Existence of Maximal $n$-Orthogonal Subcategories, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Existence of Maximal $n$-Orthogonal Subcategories will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-369279

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