๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Asymptotic enumeration of two-dimensiona
โœ M. El-Zahar; N. W. Sauer ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 271 KB

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

On building the transitive reduction of
โœ Enrico Nardelli; Vincenzo Mastrobuoni; Alesiano Santomo ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 360 KB

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. @

New results from an algorithm for counti
โœ Joseph C. Culberson; Gregory J. E. Rawlins ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 805 KB

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

Width two posets are reconstructible
โœ Dieter Kratsch; Jean-Xavier Rampon ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB