Generating All Finite Modular Lattices of a Given Size

Authors

Peter Jipsen, Chapman UniversityFollow
Nathan Lawless, Chapman University

Document Type

Article

Publication Date

11-2015

Abstract

Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold [8] developed an algorithm to enumerate, up to isomorphism, all finite lattices up to size 18. Here we adapt and improve this algorithm to construct and count modular lattices up to size 24, semimodular lattices up to size 22, and lattices of size 19. We also show that 2 ⁿ⁻³ is a lower bound for the number of nonisomorphic modular lattices of size n.

Comments

This is a pre-copy-editing, author-produced PDF of an article accepted for publication in journal, volume, issue, in year following peer review. The final publication is available at Springer via DOI: 10.1007/s00012-015-0348-x

Recommended Citation

P. Jipsen and N. Lawless, “Generating all finite modular lattices of a given size,” Algebra Univers., vol. 74, no. 3–4, pp. 253–264, 2015.
doi: 10.1007/s00012-015-0348-x

Peer Reviewed

1

Copyright

Springer