The number of finite topologies
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
The logarithm (base 2) of the number of distinct topologies on a set of $n$ elements is shown to be asymptotic to ${n^2}/4$ as $n$ goes to infinity.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Ore, Ö. (1962) · Medical Entomology and Zoology · Cited by 1,529
On the computer enumeration of finite topologies
Evans, J. W., Harary, F., & Lynn, M. S. (1967) · Communications of the ACM · doi:10.1145/363282.363311 · Cited by 88 · cited 1×
“has been determined for certain small values of n [4].”
BackgroundOn the Number of Topologies on a Finite Set
Krishnamurthy, V. (1966) · American Mathematical Monthly · doi:10.1080/00029890.1966.11970734 · Cited by 54 · cited 1×
“T„ has been estimated by several authors [2], [3], [8].”
BackgroundThe number of graded partially ordered sets
Klarner, D. A. (1969) · Journal of Combinatorial Theory · doi:10.1016/s0021-9800(69)80100-6 · Cited by 28 · cited 1×
“The sizes of certain special subsets of P(X) have been determined, and thus provide lower bounds for P„ [6], [7].”
BackgroundThe number of classes of isomorphic graded partially ordered sets
Klarner, D. A. (1970) · Journal of Combinatorial Theory · doi:10.1016/s0021-9800(70)80094-1 · Cited by 8
Cited by
Classical sequential growth dynamics for causal sets
Rideout, D. P., & Sorkin, R. D. (1999) · Physical Review D · doi:10.1103/physrevd.61.024002 · Cited by 372
Asymptotic enumeration of partial orders on a finite set
Kleitman, D. J., & Rothschild, B. L. (1975) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1975-0369090-9 · Cited by 239
“The methods used here are similar to those used in [7] for obtaining the asymptotic estimate for log Pn, but here they are somewhat more delicate and more complicated.”
BackgroundMethodInfluentialSelf-citationConstraint Acquisition via Partial Queries
Bessière, C., Coletta, R., Hébrard, E., Katsirelos, G., Lazaar, N., Narodytska, N., Quimper, C.-G., Walsh, T., Al, E., Lirmm, H. I., et al. (2013) · Cited by 64
Inverse folding of RNA pseudoknot structures
Gao, J., Li, L. Y. M., & Reidys, C. M. (2010) · Algorithms for Molecular Biology · doi:10.1186/1748-7188-5-27 · Cited by 56
“in [26] analyzed RNA secondary structures.”
Counting finite posets and topologies
Ern�, M., & Stege, K. (1991) · Order · doi:10.1007/bf00383446 · Cited by 57
Metadata
- Authors
- Kleitman, D., & Rothschild, B.
- Affiliations
- University of California, Los Angeles (US)
- Venue
- Proceedings of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1970-02-01
- Volume
- 25
- Issue
- 2
- Pages
- 276-276
- ISSN
- 0002-9939 (ISSN-L)
- OpenAlex
- W2086388790
- Cited by
- 68
- References
- 5
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 1 · 2023: 1 · 2022: 1 · 2021: 8 · 2020: 3 · 2019: 3 · 2017: 1 · 2016: 3 · 2015: 3 · 2014: 1 · 2013: 2 · 2012: 2
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Proceedings of the American Mathematical Society (publishedVersion)
- Funders
- Air Force Office of Scientific Research
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Physical Sciences › Mathematics › Geometry and Topology › Advanced Topology and Set Theory
- Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
- Keywords
- finite topology, asymptotic enumeration, logarithmic asymptotics, order theory
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The number of finite topologies. https://app.cochat.ai/papers/10.1090/s0002-9939-1970-0253944-9
- The paper
- Kleitman, D., & Rothschild, B. (1970). The number of finite topologies. Proceedings of the American Mathematical Society. https://doi.org/10.1090/s0002-9939-1970-0253944-9
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.