arXiv Analytics

Sign in

arXiv:1908.06897 [math.CO]AbstractReferencesReviewsResources

Strong G-schemes and strict homomorphisms

Frank a Campo

Published 2019-08-19Version 1

Let $\mathfrak{P}_r$ be a representation system of the non-isomorphic finite posets, and let ${\cal H}(P,Q)$ be the set of order homomorphisms from $P$ to $Q$. For finite posets $R$ and $S$, we write $R \sqsubseteq_G S$ iff, for every $P \in \mathfrak{P}_r$, a one-to-one mapping $\rho_P : {\cal H}(P,R) \rightarrow {\cal H}(P,S)$ exists which fulfills a certain regularity condition. It is shown that $R \sqsubseteq_G S$ is equivalent to $\# {\cal S}(P,R) \leq \# {\cal S}(P,S)$ for every finite posets $P$, where ${\cal S}(P,Q)$ is the set of strict order homomorphisms from $P$ to $Q$. In consequence, $\# {\cal S}(P,R) = \# {\cal S}(P,S)$ holds for every finite posets $P$ iff $R$ and $S$ are isomorphic. A sufficient condition is derived for $R \sqsubseteq_G S$ which needs the inspection of a finite number of posets only. Additionally, a method is developed which facilitates for posets $P + Q$ (direct sum) the construction of posets $T$ with $P + Q \sqsubseteq_G A + T$, where $A$ is a convex subposet of $P$.

Related articles:
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:1906.11758 [math.CO] (Published 2019-06-27)
About Generalized One-to-One Mappings between Sets of Order Homomorphisms