Counting graded lattices of rank 3 that have few coatoms

DOI10.1142/S0218196719500206WikidataQ128507881 ScholiaQ128507881MaRDI QIDQ4968235

Jukka Kohonen

Publication date: 12 July 2019

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

computer algebraisomorphismgraded latticescycle index theorem

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Lattices (06B99)

Related Items (1)

Counting graded lattices of rank 3 that have few coatoms

Uses Software

• GAP
• nauty
• OEIS
• Digraphs
• XZ Utils

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating all finite modular lattices of a given size
• On the number of distributive lattices
• Counting finite lattices.
• Constructing unlabelled lattices
• An Inductive Algorithm to Construct Finite Lattices
• The Asymptotic Number of Lattices
• The on-line encyclopedia of integer sequences
• Counting graded lattices of rank 3 that have few coatoms
• Notes on Counting: An Introduction to Enumerative Combinatorics
• Endliche Verbände.

This page was built for publication: Counting graded lattices of rank 3 that have few coatoms