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.
Document type :
Conference papers
Complete list of metadatas

https://hal-cea.archives-ouvertes.fr/cea-01836512
Contributor : Léna Le Roy <>
Submitted on : Thursday, July 12, 2018 - 1:24:33 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:28 PM

Links full text

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

60