On representation type of a pair of posets with involution
Vernadsky National Library of Ukraine
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
On representation type of a pair of posets with involution
|
|
| Creator |
Bondarenko, V.M.
|
|
| Description |
In this paper we consider the problem on classifying the representations of a pair of posets with involution. We prove that if one of these is a chain of length at least 4 with trivial involution and the other is with nontrivial one, then the pair is tame ⇔ it is of finite type ⇔ the poset with nontrivial involution is a ∗-semichain (∗ being the involution). The case that each of the posets with involution is not a chain with trivial one was considered by the author earlier. In proving our result we do not use the known technically difficult results on representation type of posets with involution. |
|
| Date |
2019-06-18T17:49:52Z
2019-06-18T17:49:52Z 2005 |
|
| Type |
Article
|
|
| Identifier |
On representation type of a pair of posets with involution / V.M. Bondarenko // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 1. — С. 1–7. — Бібліогр.: 12 назв. — англ.
1726-3255 2000 Mathematics Subject Classification: 15A, 16G. http://dspace.nbuv.gov.ua/handle/123456789/156608 |
|
| Language |
en
|
|
| Relation |
Algebra and Discrete Mathematics
|
|
| Publisher |
Інститут прикладної математики і механіки НАН України
|
|