Exponential lower bounds of lattice counts by vertical sum and 2-sum

DOI10.1007/s00012-019-0586-4zbMath1406.05008arXiv1802.05885OpenAlexW2891480696WikidataQ115609539 ScholiaQ115609539MaRDI QIDQ1729793

Jukka Kohonen

Publication date: 28 February 2019

Published in: Algebra Universalis (Search for Journal in Brave)

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

zbMATH Keywords

modular latticescountingsemimodular latticesvertical 2-sumvertical sum

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Semimodular lattices, geometric lattices (06C10) Modular lattices, Desarguesian lattices (06C05)

Related Items (1)

Cartesian lattice counting by the vertical 2-sum

Cites Work

• Unnamed Item
• Generating all finite modular lattices of a given size
• On the number of distributive lattices
• Counting finite lattices.
• Generating modular lattices of up to 30 elements
• Constructing unlabelled lattices
• The Asymptotic Number of Lattices
• Endliche Verbände.

This page was built for publication: Exponential lower bounds of lattice counts by vertical sum and 2-sum