The graphs of join-semilattices and the shape of congruence lattices of particle lattices.
From MaRDI portal
Abstract: We attach to each -semilattice a graph whose vertices are join-irreducible elements of and whose edges correspond to the reflexive dependency relation. We study properties of the graph both when is a join-semilattice and when it is a lattice. We call a -semilattice particle provided that the set of its join-irreducible elements join-generates and it satisfies DCC. We prove that the congruence lattice of a particle lattice is anti-isomorphic to the lattice of hereditary subsets of the corresponding graph that are closed in a certain zero-dimensional topology. Thus we extend the result known for principally chain finite lattices.
Recommendations
Cites work
- Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
- scientific article; zbMATH DE number 42114 (Why is no real title available?)
- scientific article; zbMATH DE number 3557835 (Why is no real title available?)
- scientific article; zbMATH DE number 3598539 (Why is no real title available?)
- scientific article; zbMATH DE number 758787 (Why is no real title available?)
- Jónsson's contributions to lattice theory
- Modular and Distributive Semilattices
- On congruence lattices of lattices
- Representation of algebraic distributive lattices with _1 compact elements as ideal lattices of regular rings
Cited in
(2)
This page was built for publication: The graphs of join-semilattices and the shape of congruence lattices of particle lattices.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4602503)