Abstract: In this paper we show that the set of closure relations on a finite poset P forms a supersolvable lattice, as suggested by Rota. Furthermore this lattice is dually isomorphic to the lattice of closed sets in a convex geometry (in the sense of Edelman and Jamison). We also characterize the modular elements of this lattice and compute its characteristic polynomial.
Recommendations
Cites work
Cited in
(12)- Surmise relations between tests -- preliminary results of the mathematical modeling
- A dimension-related metric on the lattice of knowledge spaces
- On scattered convex geometries
- Closure lattices of closure spaces
- The poset of closure systems on an infinite poset: detachability and semimodularity
- Closures on CPOs form complete lattices
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Some new closures on orders
- The sorting order on a Coxeter group.
- scientific article; zbMATH DE number 5589753 (Why is no real title available?)
- Problems related to type-\(A\) and type-\(B\) matrices of chromatic joins
- scientific article; zbMATH DE number 2159636 (Why is no real title available?)
This page was built for publication: The lattice of closure relations on a poset
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690091)