Computing congruence lattices of finite lattices

DOI10.1090/S0002-9939-97-04332-3zbMath0885.06003OpenAlexW1563736192MaRDI QIDQ4372441

Ralph Freese

Publication date: 11 December 1997

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-97-04332-3

zbMATH Keywords

algorithmcongruence latticejoin irreducible congruencesnumber of coverings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Representation theory of lattices (06B15) Structure theory of lattices (06B05) Lattice ideals, congruence relations (06B10)

Related Items

Notes on join semidistributive lattices ⋮ A note on finite lattices with many congruences ⋮ On nontrivial weak dicomplementations and the lattice congruences that preserve them ⋮ Unnamed Item ⋮ Lattices with many congruences are planar ⋮ On the largest numbers of congruences of finite lattices ⋮ Using congruence relations to extract knowledge from concept lattices ⋮ Finite semilattices with many congruences

Cites Work

• On Tamari lattices
• The arithmetical theory of Birkhoff lattices
• The imbedding problem for modular lattices
• Doubling Constructions in Lattice Theory
• Congruence Lattices of Small Planar Lattices
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item