Article contents
On the Number of Structures of Reflexive and Transitive Relations
Published online by Cambridge University Press: 20 November 2018
Extract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1973
References
- 3
- Cited by