arXiv Analytics

Sign in

arXiv:2004.11653 [math.CO]AbstractReferencesReviewsResources

New aspects of strong Hom-schemes and strong G-schemes

Frank a Campo

Published 2020-04-24Version 1

Let $\mathfrak{P}$ be the class of all finite posets. For $P, Q \in \mathfrak{P}$, let ${\cal H}(P,Q)$ and ${\cal S}(P,Q)$ be the sets of order homomorphisms and of strict order homomorphisms from $P$ to $Q$, respectively. From an earlier investigation we know, that for $R, S \in \mathfrak{P}$, the relation "$\# {\cal S}(P,R) \leq \# {\cal S}(P,S)$ for all $P \in \mathfrak{P}$" implies "$\# {\cal H}(P,R) \leq \# {\cal H}(P,S)$ for all $P \in \mathfrak{P}$". Now we ask for the inverse: For which posets $R, S \in \mathfrak{P}$ does the existence of a poset $P \in \mathfrak{P}$ with $\# {\cal S}(P,R) > \# {\cal S}(P,S)$ imply the existence of a poset $Q \in \mathfrak{P}$ with $\# {\cal H}(Q,R) > \# {\cal H}(Q,S)$? We prove that this is true for posets $P, R$, and $S$ belonging to certain classes. In particular, the implication holds for all flat posets $R$ and $S$.

Comments: 21 pages, 5 figures
Categories: math.CO
Subjects: 06A07, 06A06
Related articles: Most relevant | Search more
arXiv:1908.06897 [math.CO] (Published 2019-08-19)
Strong G-schemes and strict homomorphisms
arXiv:2201.10302 [math.CO] (Published 2022-01-25)
An inverse Fraïssé limit for finite posets and duality for posets and lattices
arXiv:1908.05681 [math.CO] (Published 2019-08-15)
Calculation Rules and Cancellation Rules for Strong Hom-Schemes