Calculation Rules and Cancellation Rules for Strong Hom-Schemes

2019/08/15 by Frank a Campo, Campo, Frank a
Mathematics · #06A06 #06A07 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:06A06 #msc:06A07

paper · pdf · doi:10.48550/arxiv.1908.05681

21 pages, 2 figures. arXiv admin note: text overlap with arXiv:1906.11758

arxiv created 2019/08/15 · arxiv updated 2019/08/19

Abstract

Let \cal H(A,B) denote the set of homomorphisms from the poset A to the poset B. In previous studies, the author has started to analyze what it is in the structure of finite posets R and S that results in # \cal H(P,R) ≤ # \cal H(P,S) for every finite poset P, if additional regularity conditions are imposed. In the present paper, it is examined if this relation (with or without regularity conditions) is compatible with the operations of order arithmetic and if cancellation rules hold.

Citations

• Generalized One-to-One Mappings between Homomorphism Sets of Digraphs

Related

• Strong G-schemes and strict homomorphisms
• Order Preserving Maps of Posets
• A recursive approach for the enumeration of the homomorphisms from a poset P to the chain C₃
• Embeddings of fields into simple algebras: generalizations and applications
• A Suspension Lemma for Bounded Posets