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...
Saved in:
| Published in: | Algebra and Discrete Mathematics |
|---|---|
| Date: | 2011 |
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2011
|
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/154863 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | 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 Ukraine| id |
nasplib_isofts_kiev_ua-123456789-154863 |
|---|---|
| record_format |
dspace |
| spelling |
Bondarenko, V.M. 2019-06-16T05:49:21Z 2019-06-16T05:49:21Z 2011 Minimax isomorphism algorithm and primitive posets / V.M. Bondarenko // Algebra and Discrete Mathematics. — 2011. — Vol. 12, № 2. — С. 31–71. — Бібліогр.: 9 назв. — англ. 1726-3255 2000 Mathematics Subject Classification:16G20. https://nasplib.isofts.kiev.ua/handle/123456789/154863 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. en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics Minimax isomorphism algorithm and primitive posets Article published earlier |
| institution |
Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| collection |
DSpace DC |
| title |
Minimax isomorphism algorithm and primitive posets |
| spellingShingle |
Minimax isomorphism algorithm and primitive posets Bondarenko, V.M. |
| title_short |
Minimax isomorphism algorithm and primitive posets |
| title_full |
Minimax isomorphism algorithm and primitive posets |
| title_fullStr |
Minimax isomorphism algorithm and primitive posets |
| title_full_unstemmed |
Minimax isomorphism algorithm and primitive posets |
| title_sort |
minimax isomorphism algorithm and primitive posets |
| author |
Bondarenko, V.M. |
| author_facet |
Bondarenko, V.M. |
| publishDate |
2011 |
| language |
English |
| container_title |
Algebra and Discrete Mathematics |
| publisher |
Інститут прикладної математики і механіки НАН України |
| format |
Article |
| description |
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.
|
| issn |
1726-3255 |
| url |
https://nasplib.isofts.kiev.ua/handle/123456789/154863 |
| citation_txt |
Minimax isomorphism algorithm and primitive posets / V.M. Bondarenko // Algebra and Discrete Mathematics. — 2011. — Vol. 12, № 2. — С. 31–71. — Бібліогр.: 9 назв. — англ. |
| work_keys_str_mv |
AT bondarenkovm minimaxisomorphismalgorithmandprimitiveposets |
| first_indexed |
2025-12-07T15:29:35Z |
| last_indexed |
2025-12-07T15:29:35Z |
| _version_ |
1850863911563165696 |