Prime orders all of whose prime suborders are selfdual (Q603888)

Let \(P=(V, \leq)\) be a finite ordered set. A subset \(X\) of \(V\) is called autonomous in \(P\) if for all \(v\in V\setminus X\) and for all \(a, a' \in X\), \((v<a \implies v<a')\) and \((a<v \implies a'<v)\). The empty set, the singleton subsets of \(V\) and the set \(V\) itself are clearly autonomous sets and these are called trivial autonomous sets. A finite ordered set \(P\) is called prime if all its autonomous subsets are trivial. It is known that there are no prime orders on a three-element set. In [\textit{H. J. Prömel}, ``Counting unlabeled structures'', J. Comb. Theory, Ser. A 44, 83--93 (1987; Zbl 0618.05029)], it was shown that almost all orders are prime. The dual of \(P\), denoted by \(P^d\), is defined by \(x\leq y\) in \(P^d\) if and only if \(y\leq x\) in \(P\). An ordered set \(P\) is called selfdual if \(P\) is isomorphic to \(P^d\). The paper under review gives a complete list of all finite prime orders each of whose prime suborders is selfdual.