论文信息 - Asymptotic enumeration of partial orders on a finite set

Asymptotic enumeration of partial orders on a finite set

By considering special cases, the number Pn of partially ordered sets on a set of n elements is shown to be (1 + O(lIn))Qn, where Qn is the number of partially ordered sets in one of the special classes. The number Qn can be estimated, and we ultimately obtain I (n n-i lnz(ni) 2i1 j(2f -1)n-i

B. Rothschild | D. Kleitman

[1] V. Krishnamurthy,et al. On the Number of Topologies on a Finite Set , 1966 .

[2] Frank Harary,et al. On the computer enumeration of finite topologies , 1967, CACM.

[3] A. Shafaat. On the number of topologies definable for a finite set , 1968, Journal of the Australian Mathematical Society.

[4] Da David Klarner,et al. The number of graded partially ordered sets , 1969 .

[5] D. Kleitman,et al. The number of finite topologies , 1970 .

[6] D. Klarner. The number of classes of isomorphic graded partially ordered sets , 1970 .