A recursive approach for the enumeration of the homomorphisms from a poset $P$ to the chain $C_3$

TL;DR

This paper introduces a recursive method to count order homomorphisms from a poset to a three-element chain, providing explicit formulas for specific poset types and advancing combinatorial enumeration techniques.

Contribution

It develops a recursive approach for calculating the number of homomorphisms from posets to a chain and derives explicit formulas for certain complex posets.

Findings

Recursive formula for counting homomorphisms to C_3

Explicit formula for homomorphisms from H(C_k, C_3)

Application to product posets like C_3 × C_3 × C_k

Abstract

Let ${\cal H}(P,C_3)$ be the set of order homomorphisms from a poset $P$ to the chain $C_3 = 1 < 2 < 3$. We develop a recursive approach for the calculation of the cardinality of ${\cal H}(P,C_3)$, and we apply it on several types of posets, including $P = C_3 \times C_3 \times C_k$ and $P = {\cal H}(C_k, C_3)$; for the latter poset $P$, we derive a direct formula for $\# {\cal H} ( P, C_3 )$.