Counting finite lattices.
type: Item
instance of: scholarly article
title: Counting finite lattices.
zbMATH Open document ID: 1058.05002
DOI: 10.1007/PL00013837
author: Jobst Heitzig
author: Jürgen Reinhold
published in: Algebra Universalis
publication date: 2005-04-19T00:00:00Z
review text: 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)].
reviewed by: Radomír Halaš
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 06A07
zbMATH DE Number: 2158795
zbMATH Keywords: orderly algorithm
zbMATH Keywords: lattice
zbMATH Keywords: tree
zbMATH Keywords: canonical
MaRDI profile type: Publication
full work available at URL: pl00013837
OpenAlex ID: W1968473297
Recommended article: Combinatorics in finite lattices
Recommended article: Counting Finite Residuated Lattices
Recommended article: Q4309112
Recommended article: Counting non-uniform lattices
Recommended article: Counting lattice points
Recommended article: Counting Co-Cyclic Lattices
Recommended article: Q4432212
Recommended article: Counting arithmetic lattices and surfaces
description: scientific article; zbMATH DE number 2158795