Generating all finite modular lattices of a given size

DOI10.1007/S00012-015-0348-XMaRDI QIDQ745707zbMATH OpenOpenAlexFDO

Authors Peter Jipsen, Nathan Lawless

Publication date 14 October 2015

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.5036

zbMATH Keywords

counting up to isomorphismmodular latticesorderly algorithmsemimodular lattices

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Continuous lattices and posets, applications (06B35)

Abstract: Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold 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^{n-3}$ is a lower bound for the number of nonisomorphic modular lattices of size $n$.

Recommendations

• Generating modular lattices of up to 30 elements
• On locally finite modular lattice varieties of finite height
• Counting finite lattices.
• Congruence Lattices of Finite Semimodular Lattices
• Lattices generated by modular elements.

Cites work

• Counting finite lattices.
• Diagrams for modular lattices
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• scientific article; zbMATH DE number 3730139 (Why is no real title available?)
• scientific article; zbMATH DE number 1181276 (Why is no real title available?)
• Isomorph-Free Exhaustive Generation
• On the number of distributive lattices
• Practical graph isomorphism. II.
• Residuated lattices of size \(\leq 12\)
• The Asymptotic Number of Lattices

Cited in

(15)

• Exponential lower bounds of lattice counts by vertical sum and 2-sum
• Enumeration of finite inverse semigroups
• Cartesian lattice counting by the vertical 2-sum
• Probability over Płonka sums of Boolean algebras: states, metrics and topology
• Generating modular lattices of up to 30 elements
• Constructing unlabelled lattices
• Computing distributed knowledge as the greatest lower bound of knowledge
• Classification of integral lattices with large class number
• Counting graded lattices of rank 3 that have few coatoms
• Counting and Computing Join-Endomorphisms in Lattices
• Basic retracts and counting of lattices
• Lie algebras with a finite number of ideals
• Simplifying modular lattices by removing doubly irreducible elements
• Counting of lattices containing up to four comparable reducible elements and having nullity up to three
• Counting of lattices containing up to 5 reducible elements and having nullity up to 3

Describes a project that uses

Uses Software

• nauty
• Traces

This page was built for publication: Generating all finite modular lattices of a given size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745707)