Michael Hawrylycz, Victor Reiner
Published 1994-09-17Version 1
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.
On the characteristic polynomial of Laplacian Matrices of Caterpillars
Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements $\mathcal{J}_n$
Characteristic Polynomial of Power Graphs on Direct Product of Any Two Finite Cyclic Groups
![QR code for arXiv:math/9409218 [math.CO]](http://oss.arxitics.com/images/favicon.svg)