Reversible Sequences of Cardinals, Reversible Equivalence Relations, and Similar Structures
Milo\v{s} S. Kurili\'c, Nenad Mora\v{c}a

TL;DR
This paper characterizes when certain relational structures and sequences of cardinals are reversible, providing criteria for reversibility in equivalence relations, posets, and related structures, with implications for topology and combinatorics.
Contribution
It introduces a comprehensive characterization of reversible sequences of cardinals and applies this to classify reversible equivalence relations, posets, and other structures.
Findings
Reversible sequences are either finite-to-one or have a specific gcd property.
Reversible structures include certain equivalence relations and posets with specific connectivity properties.
The paper identifies broad classes of reversible posets and topological spaces based on their component sequences.
Abstract
A relational structure is said to be reversible iff every bijective endomorphism is an automorphism. We define a sequence of non-zero cardinals to be reversible iff each surjection such that , for all , is a bijection, and characterize such sequences: either is a finite-to-one sequence, or , for all , , for infinitely many is a non-empty independent set, and divides at most finitely many elements of the set . 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Rings, Modules, and Algebras
