Presenting finite posets

S. Mimram (1, 2)

1 DILS (CEA, LIST) - Département Ingénierie Logiciels et Systèmes
2 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

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.

Domaines: Informatique [cs]

S. Mimram. Presenting finite posets. 8th International Workshop on Computing with Terms and Graphs (TERMGRAPH 2014), Jul 2014, Vienna, Austria. pp.1-17, ⟨10.4204/EPTCS.183.1⟩. ⟨cea-01836512⟩