An inductive algorithm to construct finite lattices
Math. Comp. 33 (1979), 409-421
Similar Articles |
Abstract: G. Birkhoff  proposed the following problem: Enumerate all finite lattices which are uniquely determined (up to isomorphism) by their diagram, considered as a graph.
It is not known how many lattices of order n exist, except when the value of n is quite small. The aim of this note is to give an algorithm to construct inductively all finite lattices of order n. Using this algorithm, we have found that there exist 222 lattices for and 1078 lattices for . All lattices of order are shown at the end of this note.
Birkhoff, Lattice theory, Third edition. American Mathematical
Society Colloquium Publications, Vol. XXV, American Mathematical Society,
Providence, R.I., 1967. MR
- G. BIRKHOFF, Lattice Theory, 3rd ed., Amer. Math. Soc. Colloq. Publ., vol. 25, Amer. Math. Soc., Providence, R. I., 1967. MR 0227053 (37:2638)
Retrieve articles in Mathematics of Computation
Retrieve articles in all journals
© Copyright 1979
American Mathematical Society