On \(k\)-CS-transitive cycle-free partial orders with finite alternating chains (Q1300337): Difference between revisions

A cycle-free partial order (CFPO) is a partially ordered set \((M,\leq)\) such that any two elements of \(M\) are connected, in the Dedekind-MacNeille completion of \(M\), by a unique path. If \(k\in\mathbb{N}\), a CFPO \((M,\leq)\) is called \(k\)-CS-transitive, if for any two isomorphic connected substructures of \(M\) of size \(k\) there is an automorphism of \((M,\leq)\) taking the first to the second. The author fully describes the structure of \(k\)-CS-transitive CFPOs not containing an infinite alternating chain, i.e., elements \(a_i\) \((i\in\mathbb{Z})\) such that \(a_{2i}< a_{2i\pm 1}\) (with no further order-relations between these elements). This completes the classification of the countable \(k\)-CS-transitive CFPOs (where \(k\geq 3\)) which was begun and intensively studied by \textit{R. Warren} [Mem. Am. Math. Soc. 614 (1997; Zbl 0887.06001)] and by \textit{P. Creed}, \textit{J. K. Truss} and \textit{R. Warren} [Math. Proc. Camb. Philos. Soc. 126, No. 1, 175-194 (1999; Zbl 0924.06002)].