STRONGLY MINIMAL PARTIAL ORDERINGS OF HEIGHT TWO

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.

Authors

Institutions

Publication Details

Journal
Herald of Kazakh-British technical university
Published
2025-03-25
DOI
https://doi.org/10.55452/1998-6688-2025-22-1-223-228
Primary Topic
semigroups and automata theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

STRONGLY MINIMAL PARTIAL ORDERINGS OF HEIGHT TWO

Beibut Kulpeshov, Ye. K. Netaliyeva
Herald of Kazakh-British technical university
semigroups and automata theory
article

STRONGLY MINIMAL PARTIAL ORDERINGS OF HEIGHT TWO

Beibut Kulpeshov, Ye. K. Netaliyeva
article en

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.

Herald of Kazakh-British technical universityVol. 22(1)
Kazakh-British Technical University (KZ), Institute of Mathematics and Mathematical Modeling (KZ)
Openalex Percentile: Top 93%
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

STRONGLY MINIMAL PARTIAL ORDERINGS OF HEIGHT TWO — Beibut Kulpeshov, Ye. K. Netaliyeva · Herald of Kazakh-British technical university (2025) | TGRS Research Map | TGRS