Work

Presenting Finite Posets

Year: 2015

Type: article

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.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.183.1

Author: Samuel Mimram

Institutions: École Polytechnique, Laboratoire d'Informatique de l'École Polytechnique

Language: English

Topic: Advanced Algebra and Logic

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Agence Nationale de la Recherche

Award: Categories, Homotopy and Rewriting