Hostname: page-component-848d4c4894-ttngx Total loading time: 0 Render date: 2024-06-08T17:31:52.040Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Number of Structures of Reflexive and Transitive Relations

Published online by Cambridge University Press:  20 November 2018

K. A. Broughan
K. A. Broughan*
Affiliation:
University of Waikato, Hamilton, New Zealand
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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
Canadian Journal of Mathematics , Volume 25 , Issue 6 , December 1973 , pp. 1269 - 1273
Copyright
Copyright © Canadian Mathematical Society 1973

References

1. Davis, R. L., The number of structures of finite relations, Proc. Amer. Math. Soc. 4 (1953), 486–495.Google Scholar
2. Gupta, H., The number of topologies on a finite set, Research Bulletin (N.S.) of the Panjab Univ. 19, parts I-II (1968), 231–241.Google Scholar
3. Broughan, K. A., Shrinking finite topologies (to appear in Math. Chronicle).Google Scholar