Counting finite lattices. (Q1771934)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting finite lattices. |
scientific article |
Statements
Counting finite lattices. (English)
0 references
19 April 2005
0 references
The authors present a fast orderly algorithm generating all un(labeled) lattices up to a given size \(n\). Using this algorithm, they compute the number \(l(n)\) of all unlabeled lattices having no more than 18 elements. This result also corrects wrong numbers \(l(11)\) and \(l(12)\) by \textit{Y. Koda} [Bull. Inst. Comb. Appl. 10, 83--89 (1994; Zbl 0806.05005)].
0 references
orderly algorithm
0 references
lattice
0 references
tree
0 references
canonical
0 references
