Open AccessOn Hasse diagrams connected with the poset (1, 2, 7)
Author(s) -
М. В. Стойка,
M. Styopochkina
Publication year - 2020
Publication title -
vìsnik. serìâ fìziko-matematičnì nauki/vìsnik kiì̈vsʹkogo nacìonalʹnogo unìversitetu ìmenì tarasa ševčenka. serìâ fìziko-matematičnì nauki
Language(s) - English
Resource type - Journals
eISSN - 2218-2055
pISSN - 1812-5409
DOI - 10.17721/1812-5409.2020/4.2
Subject(s) - partially ordered set , hasse diagram , mathematics , generalization , type (biology) , combinatorics , star product , representation (politics) , discrete mathematics , mathematical analysis , ecology , politics , political science , law , biology
Representations of posets introduced in 1972 by L. O. Nazarova and A. V. Roiter, arise when solving many problems in various fields of mathematics. One of the most important problem in the theory of representations of any objects is a description of the cases of representation finite type and representation tame type. The first of these problems for posets was solved by M. M. Kleiner, and the second L. O, Nazarova. M. M. Kleiner proved that a poset has finite type if and only if it does not contain subsets of the form (1, 1, 1, 1), (2, 2, 2), (1, 3, 3), (1, 2, 5) and (И, 4), which are called the critical sets. A generalization of this criterion to the tame case was obtained by L. O. Nazarova. The corresponding sets are called supercritical and they consist of the posets (1, 1, 1, 1, 1), (1, 1, 1, 2), (2, 2, 3), (1, 3, 4), (1, 2, 6) and (И, 5). V. M. Bondarenko proposed a generalization of the critical and supercritical posets, calling them 1-oversupercritical. This paper studies the combinatorial properties of one of such sets.