On the algorithm of differentiation D-IX for equipped posets. (Q2858096)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the algorithm of differentiation D-IX for equipped posets. |
scientific article; zbMATH DE number 6229339
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the algorithm of differentiation D-IX for equipped posets. |
scientific article; zbMATH DE number 6229339 |
Statements
19 November 2013
0 references
equipped posets
0 references
matrix problems
0 references
Gabriel quivers
0 references
differentiation algorithms
0 references
categorical equivalences
0 references
representations of posets
0 references
categories of representations
0 references
algorithm of differentiation IX
0 references
Auslander-Reiten quivers
0 references
0.93703824
0 references
0.91191274
0 references
0.90699244
0 references
0.90411055
0 references
On the algorithm of differentiation D-IX for equipped posets. (English)
0 references
Zavadskij established a number of differentiation algorithms to classify indecomposable representations of partially ordered sets of finite growth. He obtained the Auslander-Reiten quivers by studying the categorical properties of the pertinent algorithms. For equipped posets of finite growth, a categorical description of algorithm VII was given recently by Cañadas and Giraldo [\textit{A. Moreno Cañadas} and \textit{H. Giraldo}, JP J. Algebra Number Theory Appl. 29, No. 1, 91-106 (2013; Zbl 1279.16014)]. In the paper under review, a similar investigation is carried through for algorithm D-IX.
0 references
