Lattices freely generated by posets within a variety. Part I: Four easy varieties
Combinatorics
2010-04-26 v1
Abstract
We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated by partially ordered sets within four easy varieties.
Keywords
Cite
@article{arxiv.1004.4082,
title = {Lattices freely generated by posets within a variety. Part I: Four easy varieties},
author = {Jean Yves Semegni and Marcel Wild},
journal= {arXiv preprint arXiv:1004.4082},
year = {2010}
}
Comments
18 pages, 6 figures