Presenting Finite Posets
Abstract
We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of generators and relations, we construct a presentation of our category, which corresponds to a variant of the notion of bialgebra.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2015
- DOI:
- arXiv:
- arXiv:1505.07161
- Bibcode:
- 2015arXiv150507161M
- Keywords:
-
- Computer Science - Logic in Computer Science
- E-Print:
- In Proceedings TERMGRAPH 2014, arXiv:1505.06818