Approximating SP-orders through total preorders: incomparability and transitivity through permutations
Quaestiones Mathematicae, 2017•Taylor & Francis
We study finite partial orders and the concept of indistinguishability. In particular, we focus
on SP-orders. These orderings can be represented by means of Hasse diagrams and
numerical labels. Since these numerical representations can be interpreted by means of
permutations, we extend the study to the field of group theory. Through this point of view, we
introduce the new concept of total extension and total inclusion of a partial order as the total
preorders closest to the initial partial order from below and from above, respectively. Finally …
on SP-orders. These orderings can be represented by means of Hasse diagrams and
numerical labels. Since these numerical representations can be interpreted by means of
permutations, we extend the study to the field of group theory. Through this point of view, we
introduce the new concept of total extension and total inclusion of a partial order as the total
preorders closest to the initial partial order from below and from above, respectively. Finally …
Abstract
We study finite partial orders and the concept of indistinguishability. In particular, we focus on SP-orders. These orderings can be represented by means of Hasse diagrams and numerical labels. Since these numerical representations can be interpreted by means of permutations, we extend the study to the field of group theory. Through this point of view, we introduce the new concept of total extension and total inclusion of a partial order as the total preorders closest to the initial partial order from below and from above, respectively. Finally, we show a possible study of finite T0 topologies by means of its corresponding partial order.
Taylor & Francis Online以上显示的是最相近的搜索结果。 查看全部搜索结果