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...
Збережено в:
| Дата: | 2018 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Lugansk National Taras Shevchenko University
2018
|
| Теми: | |
| Онлайн доступ: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/679 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Algebra and Discrete Mathematics |
Репозитарії
Algebra and Discrete Mathematics| Резюме: | 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. |
|---|