Systems of equivalence relations on countable sets
An equivalence system (X,E) is a pair consisting of a set X and a set E of equivalence relations on X. The automorphism group Aut(X,E) is the group of all permutations of X that leave each relation in E invariant. We consider systems (X,E) with X countable and E totally ordered. We show that in this case Aut(X,E) is transitive on X if and only if the following condition is fulfilled. Whenever e and f with \(e<f\) are a covering pair in the completion of E, each equivalence class of f contains the same number of classes of e. We also give a description of the automorphism groups which arise in this way.
- Equivalence systems with finitely many relations
- Automorphism groups of numbered sets
- Equivalence structures and their automorphisms
- A note on piecewise automorphism groups of relational systems
- On characteristic sets of a system of equivalence relations
- EQUIVALENCE SYSTEMS DERIVED FROM PARTIAL ORDERS
- Equivalence Systems on Sets of Binary Sequences
- scientific article; zbMATH DE number 1304484 (Why is no real title available?)
- AUTOMORPHISM GROUPS OF SYSTEMS OF EQUIVALENCE AND PARTIAL ORDER RELATIONS
- scientific article; zbMATH DE number 2166588 (Why is no real title available?)
This page was built for publication: Systems of equivalence relations on countable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065047)