Electronic Proceedings in Theoretical Computer Science (May 2015)

Presenting Finite Posets

  • Samuel Mimram

DOI
https://doi.org/10.4204/EPTCS.183.1
Journal volume & issue
Vol. 183, no. Proc. TERMGRAPH 2014
pp. 1 – 17

Abstract

Read online

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.