Reversible Disjoint Unions of Well Orders and Their Inverses
arXiv:1711.07053
Abstract
A poset is called reversible iff every bijective homomorphism is an automorphism. Let and denote the classes of well orders and their inverses respectively. We characterize reversibility in the class of posets of the form , where , are pairwise disjoint linear orders from . First, if , for all , and , where and , defining , for , and , for , we prove that is a reversible poset iff is a finite-to-one sequence, or there is , for we have , and is a reversible sequence of natural numbers. The same holds when , for all . In the general case, the reversibility of the whole union is equivalent to the reversibility of the union of components from and the union of components from .
12 pages