paper

Calculation Rules and Cancellation Rules for Strong Hom-Schemes

arXiv:1908.05681

Abstract

Let denote the set of homomorphisms from the poset to the poset . In previous studies, the author has started to analyze what it is in the structure of finite posets and that results in $# {\cal H}(P,R) \leq # {\cal H}(P,S)$ for every finite poset , if additional regularity conditions are imposed. In the present paper, it is examined if this relation (with or without regularity conditions) is compatible with the operations of order arithmetic and if cancellation rules hold.

21 pages, 2 figures. arXiv admin note: text overlap with arXiv:1906.11758

Calculation Rules and Cancellation Rules for Strong Hom-Schemes · wovepaper