Generating modular lattices of up to 30 elements

DOI10.1007/S11083-018-9475-2zbMATH Open1476.06007arXiv1708.03750OpenAlexW2749751513MaRDI QIDQ2279675FDOQ2279675

Authors: Jukka Kohonen 

Publication date: 13 December 2019

Published in: Order (Search for Journal in Brave)

Abstract: An algorithm is presented for generating finite modular, semimodular, graded, and geometric lattices up to isomorphism. Isomorphic copies are avoided using a combination of the general-purpose graph-isomorphism tool nauty and some optimizations that handle simple cases directly. For modular and semimodular lattices, the algorithm prunes the search tree much earlier than the method of Jipsen and Lawless, leading to a speedup of several orders of magnitude. With this new algorithm modular lattices are counted up to 30 elements, semimodular lattices up to 25 elements, graded lattices up to 21 elements, and geometric lattices up to 34 elements. Some statistics are also provided on the typical shape of small lattices of these types.

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

Recommendations

• Generating all finite modular lattices of a given size
• Counting finite lattices.
• Lattices generated by modular elements.
• Cartesian lattice counting by the vertical 2-sum
• scientific article; zbMATH DE number 4045807

zbMATH Keywords

modular latticessemimodular latticesgeometric latticescounting algorithmgraded lattices

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Modular lattices, Desarguesian lattices (06C05) Semimodular lattices, geometric lattices (06C10) Computational methods for problems pertaining to ordered structures (06-08)

Cites Work

• Practical graph isomorphism. II.
• Title not available (Why is that?)
• On the number of distributive lattices
• Counting finite lattices.
• The Asymptotic Number of Lattices
• Posets on up to 16 points
• Generating all finite modular lattices of a given size
• Constructing unlabelled lattices

Cited In (8)

• Exponential lower bounds of lattice counts by vertical sum and 2-sum
• Modulars from Nakano onwards
• Constructing unlabelled lattices
• Basic retracts and counting of lattices
• Title not available (Why is that?)
• Cartesian lattice counting by the vertical 2-sum
• Generating all finite modular lattices of a given size
• Title not available (Why is that?)

This page was built for publication: Generating modular lattices of up to 30 elements

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