论文信息 - Posets on up to 16 Points

Posets on up to 16 Points

In this article we describe a very efficient method to construct pairwise non-isomorphic posets (equivalently, T0 topologies). We also give the results obtained by a computer program based on this algorithm, in particular the numbers of non-isomorphic posets on 15 and 16 points and the numbers of labelled posets and topologies on 17 and 18 points.

Brendan D. McKay | Gunnar Brinkmann | B. McKay | G. Brinkmann

[1] N. Lygeros,et al. Progrès dans l'énumération des posets , 1992 .

[2] Jürgen Reinhold,et al. The Number of Unlabeled Orders on Fourteen Elements , 2000, Order.

[3] James L. Walsh,et al. IBM experiments in soft fails in computer electronics (1978-1994) , 1996, IBM J. Res. Dev..

[4] Brendan D. McKay,et al. Isomorph-Free Exhaustive Generation , 1998, J. Algorithms.

[5] Hans Jürgen Prömel,et al. Counting unlabeled structures , 1987, J. Comb. Theory, Ser. A.

[6] N. Lygeros,et al. The number of orders with thirteen elements , 1992 .

[7] M. El-Zahar. Enumeration of Ordered Sets , 1989 .

[8] Marcel Erné,et al. Counting finite posets and topologies , 1991 .

[9] B. McKay. nauty User ’ s Guide ( Version 2 . 4 ) , 1990 .

[10] Shawpawn Kumar Das. A Machine Representation of Finite T0 Topologies , 1977, JACM.

[11] Gregory J. E. Rawlins,et al. New results from an algorithm for counting posets , 1990 .

[12] B. Rothschild,et al. Asymptotic enumeration of partial orders on a finite set , 1975 .

[13] R. Möhring. Algorithmic Aspects of Comparability Graphs and Interval Graphs , 1985 .