Hostname: page-component-6d856f89d9-4thr5 Total loading time: 0 Render date: 2024-07-16T08:43:50.584Z Has data issue: false hasContentIssue false
  • English
  • Français

On the number of topologies definable for a finite set

Published online by Cambridge University Press:  09 April 2009

A. Shafaat
A. Shafaat
Affiliation:
Institute of Advanced Studies The Australian National UniversityCanberra, A.C.T. and Panjab University Lahore, Pakistan
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.

No general rule for determining the number N(n) of topologies definable for a finite set of cardinal n is known. In this note we relate N(n) to a function Ft(r1,…, rt+1) defined below which has a simple combinatorial interpretation. This relationship seems useful for the study of N (n). In particular this can be used to calculate N(n) for small values. For n 3, 4, 5, 6 we find N(3) = 29, N(4) = 355, N(5) = 7,181, N(6) = 145,807.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 8 , Issue 2 , May 1968 , pp. 194 - 198
Copyright
Copyright © Australian Mathematical Society 1968

References

1 Strictly speaking, members of B 4-i must be taken as the unions ∪ Y(i, k) of all sets represented by the x's in Y(i, k), but since x's represent disjoint sets this will not effect our conclusion about F 3(r 1 …, r 4)