|
|
REFERENCES
|
G. Birkhoff, Lattice Theory, 1961, p. 4.
C. Chaunier and N. Lygeros, Progres dans l'enumeration des posets, C. R. Acad. Sci. Paris 314 serie I (1992) 691-694.
C. Chaunier and N. Lygeros, The Number of Orders with Thirteen Elements, Order 9:3 (1992) 203-204.
C. Chaunier and N. Lygeros, Le nombre de posets a isomorphie pres ayant 12 elements. Theoretical Computer Science, 123 p. 89-94, 1994.
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 60.
Davison, J. L. Asymptotic enumeration of partial orders. Proceedings of the seventeenth Southeastern international conference on combinatorics, graph theory, and computing (Boca Raton, Fla., 1986). Congr. Numer. 53 (1986), 277--286. MR0885256 (88c:06001)
R. Fraisse and N. Lygeros, Petits posets: denombrement, representabilite par cercles et compenseurs. C. R. Acad. Sci. Paris, 313, I, 417-420, 1991.
DONGSEOK KIM, YOUNG SOO KWON AND JAEUN LEE, Enumerations of finite topologies associated with a finite graph, Arxiv preprint arXiv:1206.0550, 2012. - From N. J. A. Sloane, Nov 09 2012
D. J. Kleitman and B. L. Rothschild, Asymptotic enumeration of partial orders on a finite set, Trans. Amer. Math. Soc., 205 (1975) 205-220.
N. Lygeros, Calculs exhaustifs sur les posets d'au plus 7 elements. SINGULARITE, vol. 2 n4 p. 10-24, avril 1991.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 1, Chap. 3, pages 96ff; Vol. I, 2nd. ed., Chap. 3, pp. 241ff; Vol. 2, Problem 5.39, p. 88.
For further references concerning the enumeration of topologies and posets see under A001035.
|
|
|
LINKS
|
David Wasserman, Table of n, a(n) for n = 0..16
R. Bayon, N. Lygeros and J.-S. Sereni, New progress in enumeration of mixed models, Applied Mathematics E-Notes, 5 (2005), 60-65.
R. Bayon, N. Lygeros and J.-S. Sereni, Nouveaux progr\`es dans l'\'enum\'eration des mod\`eles mixtes, in Knowledge discovery and discrete mathematics : JIM'2003, INRIA, Universit\'e de Metz, France, 2003, pp. 243-246.
Gunnar Brinkmann and Brendan D. McKay, Counting unlabeled topologies and transitive relations.
G. Brinkmann and B. D. McKay, Posets on up to 16 Points [On Brendan McKay's home page]
G. Brinkmann and B. D. McKay, Posets on up to 16 Points, Order 19 (2) (2002) 147-179.
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
S. R. Finch, Transitive relations, topologies and partial orders
Ann Marie Hess, Mixed Models Site
N. Lygeros and P. Zimmermann, Computation of P(14), the number of posets with 14 elements: 1.338.193.159.771
G. Pfeiffer, Counting Transitive Relations, Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.2.
Bob Proctor, Chapel Hill Poset Atlas
D. Rusin, Further information and references
N. J. A. Sloane, Classic Sequences
Index entries for sequences related to posets
Index entries for "core" sequences
|