pith. sign in

arxiv: 1705.05781 · v1 · pith:TEMX47C6new · submitted 2017-05-15 · 🧮 math.CO

A Compact Representation for Modular Semilattices and its Applications

classification 🧮 math.CO
keywords modularsemilatticesemilatticesposetrepresentationresultsalgorithmbases
0
0 comments X
read the original abstract

A modular semilattice is a semilattice generalization of a modular lattice. We establish a Birkhoff-type representation theorem for modular semilattices, which says that every modular semilattice is isomorphic to the family of ideals in a certain poset with additional relations.This new poset structure, which we axiomatize in this paper, is called a PPIP (projective poset with inconsistent pairs). A PPIP is a common generalization of a PIP (poset with inconsistent pairs) and a projective ordered space. The former was introduced by Barth\'elemy and Constantin for establishing Birkhoff-type theorem for median semilattices, and the latter by Herrmann, Pickering, and Roddy for modular lattices. We show the $\Theta (n)$ representation complexityand a construction algorithm for PPIP-representations of $(\wedge, \vee)$-closed sets in the product $L^n$ of modular semilattice $L$. This generalizes the results of Hirai and Oki for a special median semilattice $S_k$. We also investigate implicational bases for modular semilattices. Extending earlier results of Wild and Herrmann for modular lattices, we determine optimal implicational bases and develop a polynomial time recognition algorithm for modular semilattices. These results can be applied to retain the minimizer set of a submodular function on a modular semilattice.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.