No label defined (Q4215752)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1216002
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1216002 |
Statements
27 October 1998
0 references
hammocks
0 references
finite translation quivers
0 references
Auslander-Reiten quivers
0 references
representation-finite algebras
0 references
partially ordered sets
0 references
string algebras
0 references
tame algebras
0 references
0.8676957
0 references
0.86744225
0 references
0.8654036
0 references
0.8653998
0 references
0.8611215
0 references
0 references
In 1986, S. Brenner introduced the concept of hammocks in order to decide when a finite translation quiver is the Auslander-Reiten quiver of a representation-finite algebra. These hammocks are partially ordered sets (posets) which describe the factorizations of the canonical homomorphism \(f_S\colon P\to I\). Here \(P\) (respectively \(I\)) is the projective cover (respectively injective envelope) of the simple module \(S\), and the image of \(f_S\) in \(S\). After that C.~M. Ringel, D.~Vossieck and Y.~Lin gave an axiomatic treatment of these posets in the representation-finite case. In this paper, we consider the class of string algebras and deal with the corresponding problem. These algebras are usually representation-infinite and are regarded as an important class of tame algebras. We introduce a generalized notion of hammocks for string algebras and prove various combinatorial properties of these posets. In case one is dealing with a representation-finite string algebra, our definition and the definition given by Ringel and Vossieck coincide. As a main application, we compute the index of nilpotency (up to a small error term) of the radical of \(A\)-mod where \(A\) is a string algebra. We also construct examples which show that every possible index occurs. Only very few examples of this type were known before.
0 references