Presenting finite posets - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Presenting finite posets

(1, 2)
1
2

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.

Dates and versions

cea-01836512 , version 1 (12-07-2018)

Identifiers

Cite

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⟩
45 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More