Minimax isomorphism algorithm and primitive posets

dc.contributor.author	Bondarenko, V.M.
dc.date.accessioned	2019-06-16T05:49:21Z
dc.date.available	2019-06-16T05:49:21Z
dc.date.issued	2011
dc.identifier.citation	Minimax isomorphism algorithm and primitive posets / V.M. Bondarenko // Algebra and Discrete Mathematics. — 2011. — Vol. 12, № 2. — С. 31–71. — Бібліогр.: 9 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2000 Mathematics Subject Classification:16G20.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/154863
dc.description.abstract	The notion of minimax equivalence of posets, and a close notion of minimax isomorphism, introduced by the author are widely used in the study of quadratic Tits forms (in particular, for the description of P-critical and P-supercritical posets). In this paper, for an important special case, we modify an algorithm of classifying all posets minimax isomorphic to a given one (described earlier by the author together with M.V.Stepochkina) by introducing the concept of weak isomorphism.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Minimax isomorphism algorithm and primitive posets	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA