arXiv Analytics

Sign in

arXiv:2008.03279 [math.CO]AbstractReferencesReviewsResources

About finite posets R and S with \# H(P,R) <= \# H(P,S) for every finite poset P

Frank a Campo

Published 2020-08-04Version 1

Finite posets $R$ and $S$ are studied with $\# {\cal H}(P,R) \leq \# {\cal H}(P,S)$ for every finite poset $P$, where ${\cal H}(P,Q)$ is the set of order homomorphisms from $P$ to $Q$. It is shown that under an additional regularity condition, $\# {\cal H}(P,R) \leq \# {\cal H}(P,S)$ for every finite poset $P$ is equivalent to $\# {\cal S}(P,R) \leq \# {\cal S}(P,S)$ for every finite poset $P$, where ${\cal S}(P,Q)$ is the set of strict order homomorphisms from $P$ to $Q$. A method is developed for the rearrangement of a finite poset $R$, resulting in a poset $S$ with $\# {\cal H}(P,R) \leq \# {\cal H}(P,S)$ for every finite poset $P$. The results are used in constructing pairs of posets $R$ and $S$ with this property.

Comments: 24 pages, 7 figures. arXiv admin note: text overlap with arXiv:arXiv:1908.06897
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:1908.05681 [math.CO] (Published 2019-08-15)
Calculation Rules and Cancellation Rules for Strong Hom-Schemes
arXiv:math/9409218 [math.CO] (Published 1994-09-17)
The lattice of closure relations of a poset