Mathematics – Combinatorics
Scientific paper
1994-09-17
Mathematics
Combinatorics
8 pages
Scientific paper
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.
Hawrylycz Michael
Reiner Victor
No associations
LandOfFree
The lattice of closure relations of a poset does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The lattice of closure relations of a poset, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The lattice of closure relations of a poset will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-209364