Strong G-schemes and strict homomorphisms

Abstract

Let Pr be a representation system of the non-isomorphic finite posets, and let H(P,Q) be the set of order homomorphisms from P to Q. For finite posets R and S, we write R G S iff, for every P ∈ Pr, a one-to-one mapping P : H(P,R) → H(P,S) exists which fulfills a certain regularity condition. It is shown that R G S is equivalent to \# S(P,R) ≤ \# S(P,S) for every finite posets P, where S(P,Q) is the set of strict order homomorphisms from P to Q. In consequence, \# S(P,R) = \# S(P,S) holds for every finite posets P iff R and S are isomorphic. A sufficient condition is derived for R 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 G A + T, where A is a convex subposet of P.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…