Asymptotic enumeration of partial orders on a finite set
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
By considering special cases, the number ${P_n}$ of partially ordered sets on a set of $n$ elements is shown to be $(1 + O(1/n)){Q_n}$, where ${Q_n}$ is the number of partially ordered sets in one of the special classes. The number ${Q_n}$ can be estimated, and we ultimately obtain \[ {P_n} = \left ( {1 + O\left ( {\frac {1}{n}} \right )} \right )\left ( {\sum \limits _{i = 1}^n {\sum \limits _{j = 1}^{n - i} {\left ( {_i^n} \right )\left ( {_j^{n - i}} \right ){{\left ( {{2^i} - 1} \right )}^j}{{\left ( {{2^j} - 1} \right )}^{n - i - j}}} } } \right ).\]
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The number of finite topologies
Kleitman, D., & Rothschild, B. (1970) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1970-0253944-9 · Cited by 68 · cited 5×
“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-citation
Cited by
Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization
Möhring, R. H., & Radermacher, F. J. (1984) · North-Holland Mathematics Studies · doi:10.1016/s0304-0208(08)72966-9 · Cited by 258
Metadata
- Authors
- Kleitman, D. J., & Rothschild, B. L.
- Venue
- Transactions of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1975
- Volume
- 205
- Pages
- 205-205
- ISSN
- 0002-9947 (ISSN-L)
- OpenAlex
- W2018883342
- Cited by
- 239
- References
- 1
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Asymptotic enumeration of partial orders on a finite set. https://app.cochat.ai/papers/10.1090/s0002-9947-1975-0369090-9
- The paper
- Kleitman, D. J., & Rothschild, B. L. (1975). Asymptotic enumeration of partial orders on a finite set. Transactions of the American Mathematical Society. https://doi.org/10.1090/s0002-9947-1975-0369090-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.