On representation type of a pair of posets with involution

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/142

Full metadata record

DC Field	Value	Language
dc.contributor.author	Bondarenko, Vitalij M.	-
dc.date.accessioned	2015-11-11T13:00:37Z	-
dc.date.available	2015-11-11T13:00:37Z	-
dc.date.issued	2004	-
dc.identifier.issn	1726-3255	-
dc.identifier.uri	http://hdl.handle.net/123456789/142	-
dc.description.abstract	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.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Луганский национальный университет им. Т. Шевченко	uk_UA
dc.subject	математика	uk_UA
dc.title	On representation type of a pair of posets with involution	uk_UA
dc.title.alternative	Dedicated to Yu.A. Drozd on the occasion of his 60th birthday	uk_UA
dc.type	Article	uk_UA
Appears in Collections:	Статті

Files in This Item:

File	Description	Size	Format
adm-n1-1.pdf		135.53 kB	Adobe PDF	View/Open

DSpace JSPUI