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 ca...
Saved in:
| Date: | 2018 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2018
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/679 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete Mathematics| Summary: | 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. |
|---|