In this paper we show that the number of pairwise nonisomorphic two-dimensional posets with n elements is asymptotically equivalent to =l n!. This estimate is based on a characterization, in terms of structural decomposmon, of two-d~mensmnal posets having a umque rep~\*sentation as the intersection
Counting two-dimensional posets
โ Scribed by Bayoumi I. Bayoumi; Mohamed H. El-Zahar; Soheir M. Khamis
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 482 KB
- Volume
- 131
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
The number of unlabeled 2-dimensional posets is recursively calculated. This counting makes use of the relationship between permutations and posets of dimension two.
๐ SIMILAR VOLUMES
In this paper we provide an efficient algorithm for computing the graph representing the transitive reduction of a two-dimensional poset which is given by means of the two linear extensions realizing it. @
In this paper we report on the success of a new technique for computing the number of unlabeled partial orders on n elements based on the partial order of partial orders ordered by containment. In addition to the number of partial orders, we obtain complete enumerations of the number of partial orde