Strong G-schemes and strict homomorphisms
Combinatorics
2019-08-20 v1
Abstract
Let be a representation system of the non-isomorphic finite posets, and let be the set of order homomorphisms from to . For finite posets and , we write iff, for every , a one-to-one mapping exists which fulfills a certain regularity condition. It is shown that is equivalent to for every finite posets , where is the set of strict order homomorphisms from to . In consequence, holds for every finite posets iff and are isomorphic. A sufficient condition is derived for which needs the inspection of a finite number of posets only. Additionally, a method is developed which facilitates for posets (direct sum) the construction of posets with , where is a convex subposet of .
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