Presenting Finite Posets
Copyright policy )Presenting Finite Posets
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.
In Proceedings TERMGRAPH 2014, arXiv:1505.06818
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Electronic computers. Computer science, QA1-939, QA75.5-76.95, [INFO] Computer Science [cs], Mathematics, Logic in Computer Science (cs.LO)
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Electronic computers. Computer science, QA1-939, QA75.5-76.95, [INFO] Computer Science [cs], Mathematics, Logic in Computer Science (cs.LO)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!