Cartesian lattice counting by the vertical 2-sum

DOI10.1007/s11083-021-09569-0OpenAlexW3164007326MaRDI QIDQ2141002

Jukka Kohonen

Publication date: 23 May 2022

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

countingdistributive latticemodular latticevertical 2-sum

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Uses Software

• nauty
• OEIS
• Traces
• XZ Utils

Cites Work

• Generating all finite modular lattices of a given size
• Planar lattices are lexicographically shellable
• On the number of distributive lattices
• Counting Steiner triple systems
• Exponential lower bounds of lattice counts by vertical sum and 2-sum
• Counting finite lattices.
• Generating modular lattices of up to 30 elements
• Constructing unlabelled lattices
• Practical graph isomorphism. II.
• Nonisomorphic Steiner triple systems
• Lattice Theory: Foundation
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Whitney Number Inequalities for Geometric Lattices

This page was built for publication: Cartesian lattice counting by the vertical 2-sum