Minimax isomorphism algorithm and primitive posets
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 m...
Gespeichert in:
Datum: | 2011 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | English |
Veröffentlicht: |
Інститут прикладної математики і механіки НАН України
2011
|
Schriftenreihe: | Algebra and Discrete Mathematics |
Online Zugang: | http://dspace.nbuv.gov.ua/handle/123456789/154863 |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
Zitieren: | Minimax isomorphism algorithm and primitive posets / V.M. Bondarenko // Algebra and Discrete Mathematics. — 2011. — Vol. 12, № 2. — С. 31–71. — Бібліогр.: 9 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of UkraineZusammenfassung: | 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. |
---|