Counting Finite Lattices |
| |
| Authors: | Jobst Heitzig Jürgen Reinhold |
| |
| Affiliation: | 1.Universit?t Hannover, Institut für Mathematik, Welfengarten 1, 30167 Hannover, Germany, e-mail: heitzig@math.uni-hannover.de,DE;2.Universit?t Hannover, Institut für Mathematik, Welfengarten 1, 30167 Hannover, Germany, e-mail: reinhold@math.uni-hannover.de,DE |
| |
| Abstract: | The correct values for the number of all unlabeled lattices on n elements are known for . We present a fast orderly algorithm generating all unlabeled lattices up to a given size n. Using this algorithm, we have computed the number of all unlabeled lattices as well as that of all labeled lattices on an n-element set for each . Received April 4, 2000; accepted in final form November 2, 2001. RID="h1" ID="h1" Presented by R. Freese. |
| |
| Keywords: | and phrases: Orderly algorithm (un-)labeled lattice tree canonical levelized. |
| 本文献已被 SpringerLink 等数据库收录！ |
|
