Strongly Minimal Partial Orderings Having an Infinite Non-trivial Width

B. Sh. Kulpeshov, Ye. K. Netaliyeva

2026

Closed access Metadata (CSL-JSON)
DOI 10.1134/s1995080225609397
Data confidence 70 medium
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

Abstract In the present paper, we study strongly minimal partial orderings in the signature containing only the symbol of binary relation for a 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. 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 such partial orderings.