Simplifying modular lattices by removing doubly irreducible elements
Combinatorics
2025-04-16 v2 Discrete Mathematics
Abstract
Lattices are simplified by removing some of their doubly irreducible elements, resulting in smaller lattices called racks. All vertically indecomposable modular racks of elements are listed, and the numbers of all modular lattices of elements are obtained by P\'olya counting. SageMath code is provided that allows easy access both to the listed racks, and to the modular lattices that were not listed. More than 3000-fold savings in storage space are demonstrated.
Keywords
Cite
@article{arxiv.2311.16643,
title = {Simplifying modular lattices by removing doubly irreducible elements},
author = {Jukka Kohonen},
journal= {arXiv preprint arXiv:2311.16643},
year = {2025}
}
Comments
16 pages