Existence of a 2-cluster tilting module does not imply finite complexity
Let \(A\) be a finite dimensional algebra, and let mod-\(A\) be the category of finite dimensional (right) \(A\)-modules. An \(A\)-module \(M\) is called an \textit{\(n\)-clister tilting module} if \(\text{add}(M)=\{X\in \text{mod-}A|\text{Ext}^i_A(M,X)=0\text{ for }1\leq i\leq n-1\}=\{X\in \text{mod-}A|\text{Ext}^i_A(X,M)=0\text{ for }1\leq i\leq n-1\}\). In the paper [Proc. Am. Math. Soc. 136, No. 9, 3069--3078 (2008; Zbl 1153.16010)], \textit{K. Erdmann} and \textit{T. Holm} posed the following question: If \(A\) admits an \(n\)-cluster tilting module for some \(n\ge 2\), does every \(A\)-module have complexity at most one? The paper under review provides a negative answer of the above question. The authors construct a finite dimensional algebra \(A\), and proved that the module \(M:=A\oplus D(A)\) is a 2-cluster tilting module, but \(A\) has a simple module whose complexity is infinite.
- \(d\)-representation-finite self-injective algebras
- \(n\)-cluster tilting subcategories of representation-directed algebras
- Auslander correspondence.
- Auslander-Gorenstein algebras from Serre-formal algebras via replication
- Cluster tilting for higher Auslander algebras.
- Frobenius algebras. I: Basic representation theory.
- Gluing of \(n\)-cluster tilting subcategories for representation-directed algebras
- Higher-dimensional Auslander-Reiten theory on maximal orthogonal subcategories.
- scientific article; zbMATH DE number 3517355 (Why is no real title available?)
- scientific article; zbMATH DE number 707210 (Why is no real title available?)
- scientific article; zbMATH DE number 2228448 (Why is no real title available?)
- Maximal 𝑛-orthogonal modules for selfinjective algebras
- Rigid modules over preprojective algebras.
- Selfinjective quivers with potential and 2-representation-finite algebras
- Stable categories of higher preprojective algebras.
This page was built for publication: Existence of a 2-cluster tilting module does not imply finite complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667915)