2017/09/27 by Kurilić, Miloš S., Morača, Nenad
#03C07 #03C50 #03E05 #05C20 #05C40 #06A06 #FOS: Mathematics #Logic (math.LO)
paper · doi:10.48550/arxiv.1709.09492
A relational structure \mathbb X is said to be reversible iff every bijective endomorphism f:X→ X is an automorphism. We define a sequence of non-zero cardinals ⟨ κi :i∈ I⟩ to be reversible iff each surjection f :I→ I such that κj =∑_i∈ f-1[\ j \]κi, for all j∈ I , is a bijection, and characterize such sequences: either ⟨ κi :i∈ I⟩ is a finite-to-one sequence, or κi∈ \mathbb N, for all i∈ I, K:=\ m∈ \mathbb N : κi =m , for infinitely many i∈ I \ is a non-empty independent set, and gcd (K) divides at most finitely many elements of the set \ κi :i∈ I \. We isolate a class of binary structures such that a structure from the class is reversible iff the sequence of cardinalities of its connectivity components is reversible. In particular, we characterize reversible equivalence relations, reversible posets which are disjoint unions of cardinals ≤ ω, and some similar structures. In addition, we show that a poset with linearly ordered connectivity components is reversible, if the corresponding sequence of cardinalities is reversible and, using this fact, detect a wide class of examples of reversible posets and topological spaces.