For finite posets, compatibility and cancellation rules for the strong Hom-, G-, and I-scheme order relations are proved under sums, ordinal sums, and products, with several cases left open.
Lov´ asz: Operations with structures
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Calculation Rules and Cancellation Rules for Strong Hom-Schemes
For finite posets, compatibility and cancellation rules for the strong Hom-, G-, and I-scheme order relations are proved under sums, ordinal sums, and products, with several cases left open.