w x Hammocks have been considered by Brenner 3 in order to give a numerical criterion for a finite translation quiver to be the Auslander] Reiten quiver of some representation-finite algebra. Ringel and Vossieck w x 13 gave a combinatorial definition of left hammocks, which generalizes the concept of hammocks, in the sense of Brenner, as a translation quiver Ž . H and an additive function h on H called the hammock function satisfying some conditions. They also showed that a thin left hammock with finitely many projective vertices is just the preprojective component of the Auslander]Reiten quiver of the category of S , where S is a finite Ž . partially ordered sets abbreviated poset . An important role of posets in representation theory is played by two differentiation algorithms. One of w x the algorithms is due to Nazarova and Roiter 9 and it reduces a poset S with a maximal element a g S to a new poset S X s S with same a w x representation type. The second algorithm is due to Zavadskii 15 and it Ž . reduces a poset S with a suitable pair a, b of elements a, b to a new poset S X s S with same representation type. Zavadskii ’s algorithm Ža, b. is successfully used to give new proofs for characterizing posets of finite w x w x type 5 and for characterizing posets of wild type 10 in studying posets of w x w x finite growth 15 . In the paper 7 , we discussed the relationship between hammocks and the algorithm of Nazarova and Roiter. The main purpose of the present paper is to construct some new left hammocks from a given one, and to show the relationship between these new left hammocks and the algorithm of Zavadskii . In Section 2, we recall some basic definitions and facts. Let H be a thin Ž . left hammock with hammock function h , let p a a projective vertex of H Ž . H different from the source, and let q b an injective vertex of H different
Read full abstract