English

Strong G-schemes and strict homomorphisms

Combinatorics 2019-08-20 v1

Abstract

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

Keywords

Cite

@article{arxiv.1908.06897,
  title  = {Strong G-schemes and strict homomorphisms},
  author = {Frank a Campo},
  journal= {arXiv preprint arXiv:1908.06897},
  year   = {2019}
}

Comments

23 pages, 9 figures

R2 v1 2026-06-23T10:51:12.879Z