STRONGLY MINIMAL PARTIAL ORDERINGS OF HEIGHT TWO

Herald of Kazakh-British technical university, 2025

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.55452/1998-6688-2025-22-1-223-228
Data confidence 85 high
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

In the present paper, we study strongly minimal partial orderings in the signature containing only the symbol of binary relation of partial order. We use for partial orderings such characteristics as the height of a structure that is the supremum of lengths of ordered chains, and the width of a structure that is the supremum of lengths of antichains, where an antichain is a set of pairwise incomparable elements. We also differ trivial width and non-trivial width. Recently, B.Sh. Kulpeshov, In.I. Pavlyuk and S.V. Sudoplatov described strongly minimal partial orderings having a finite non-trivial width. Here we study strongly minimal partial orderings having an infinite non-trivial width. The main result of the paper is a criterion for strong minimality of an infinite partial ordering of height two having an infinite non-trivial width.