Equivalence systems with finitely many relations (Q1084424): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3918939 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Systems of equivalence relations on countable sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The characterization of generalized wreath products / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Applications of the Wreath Product Construction / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:36, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence systems with finitely many relations |
scientific article |
Statements
Equivalence systems with finitely many relations (English)
0 references
1987
0 references
We consider a set X with a finite totally ordered set E of equivalence relations on X. We describe the automorphism group of this system, that is, the group of all those permutations of X that leave each relation in E invariant.
0 references
equivalence relations
0 references
automorphism group
0 references
