arXiv Analytics

Sign in

arXiv:1908.05681 [math.CO]AbstractReferencesReviewsResources

Calculation Rules and Cancellation Rules for Strong Hom-Schemes

Frank a Campo

Published 2019-08-15Version 1

Let ${\cal H}(A,B)$ denote the set of homomorphisms from the poset $A$ to the poset $B$. In previous studies, the author has started to analyze what it is in the structure of finite posets $R$ and $S$ that results in $# {\cal H}(P,R) \leq # {\cal H}(P,S)$ for every finite poset $P$, 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.

Comments: 21 pages, 2 figures. arXiv admin note: text overlap with arXiv:1906.11758
Categories: math.CO
Subjects: 06A07, 06A06
Related articles: Most relevant | Search more
arXiv:2004.11653 [math.CO] (Published 2020-04-24)
New aspects of strong Hom-schemes and strong G-schemes
arXiv:2008.03279 [math.CO] (Published 2020-08-04)
About finite posets R and S with \# H(P,R) <= \# H(P,S) for every finite poset P
arXiv:math/9409218 [math.CO] (Published 1994-09-17)
The lattice of closure relations of a poset