Generating all finite modular lattices of a given size

DOI10.1007/s00012-015-0348-xzbMath1322.05009arXiv1309.5036OpenAlexW1612842311MaRDI QIDQ745707

Nathan Lawless, Peter Jipsen

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

modular latticesorderly algorithmsemimodular latticescounting up to isomorphism

Mathematics Subject Classification ID

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

Related Items (11)

Lie algebras with a finite number of ideals ⋮ Cartesian lattice counting by the vertical 2-sum ⋮ Counting and Computing Join-Endomorphisms in Lattices ⋮ Computing distributed knowledge as the greatest lower bound of knowledge ⋮ Exponential lower bounds of lattice counts by vertical sum and 2-sum ⋮ Probability over Płonka sums of Boolean algebras: states, metrics and topology ⋮ Enumeration of finite inverse semigroups ⋮ Generating modular lattices of up to 30 elements ⋮ Constructing unlabelled lattices ⋮ Counting graded lattices of rank 3 that have few coatoms ⋮ Unnamed Item

Uses Software

• nauty
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Residuated lattices of size \(\leq 12\)
• Diagrams for modular lattices
• On the number of distributive lattices
• Counting finite lattices.
• Practical graph isomorphism. II.
• The Asymptotic Number of Lattices
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Isomorph-Free Exhaustive Generation

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