Order varieties and monotone retractions of finite posets (Q5947340): Difference between revisions

The authors introduce a new version of the concept of order varieties. They define order varieties as a class of posets closed under retractions, idempotent subalgebra and product. They prove that a finite connected poset \(P\) admits a NUF if the two-element antichain is not in the order variety generated by \(P\) and show that this class of posets has a special dismantling retraction property. They give a polynomial-time algorithm which decides the existence of a NUF on a finite poset and prove that if every idempotent subalgebra of a finite poset \(P\) is connected, then \(P\) admits symmetric idempotent monotone operations.