Type: Article
Publication Date: 1973-12-01
Citations: 7
DOI: https://doi.org/10.4153/cjm-1973-133-9
If for each permutation the number of partial orderings fixed by that permutation is known, it is possible to count the number of non-isomorphic partial orderings on a finite set using a lemma of Burnside. In this paper it is shown that knowledge of the numbers of partial orderings fixed by permutations will enable the number of non-isomorphic pre-orderings to be counted also.
Action | Title | Year | Authors |
---|---|---|---|
+ | Counting finite posets and topologies | 1991 |
Marcel Ern� Kurt Stege |
+ | Periodicity of residues of the number of finite labeled topologies | 1984 |
Z. I. Borevich |
+ | Bibliography | 1975 |
Action | Title | Year | Authors |
---|---|---|---|
+ | On the Number of Topologies on A Finite Set | 1966 |
V. Krishnamurthy |