On the recursive construction of indecomposable quiver representations (Q497701)

From MaRDI portal





scientific article; zbMATH DE number 6485309
Language Label Description Also known as
default for all languages
No label defined
    English
    On the recursive construction of indecomposable quiver representations
    scientific article; zbMATH DE number 6485309

      Statements

      On the recursive construction of indecomposable quiver representations (English)
      0 references
      0 references
      25 September 2015
      0 references
      Generalizations of exceptional sequences are considered to construct indecomposable quiver representations recursively. The idea is to regard a finite set of representations of a quiver \(Q\) as the vertices of a new quiver \(Q'\) such that the number of arrows between two vertices is equal to the dimension of the corresponding Ext-group. This gives a faithful functor from \(Q'\)-modules to \(Q\)-modules. If the vertices of \(Q'\) are Schurian and there are no homomorphisms between them, it is proved that the functor is also full. This extends \textit{A. Schofield}'s induction [Proc. Lond. Math. Soc. (3) 65, No. 1, 46--64 (1992; Zbl 0795.16008)]. With other conditions, a generalization of \textit{C. M. Ringel}'s reflection functors for hereditary algebras [J. Lond. Math. Soc., II. Ser. 21, 465--479 (1980; Zbl 0445.16021)] is obtained. Ringel proved that exceptional modules are tree modules and conjectured that every root admits an indecomposable tree module. The author has verified this for imaginary Schur roots [Bull. Lond. Math. Soc. 44, No. 5, 882--898 (2012; Zbl 1279.16015)]. As the functors in the paper under review increase dimension vectors, there is hope for a possible recursive construction to verify Ringel's conjecture.
      0 references
      0 references
      recursive construction of indecomposable quiver representations
      0 references
      Schofield induction
      0 references
      Ringel's reflection functor
      0 references

      Identifiers