We give a dichotomy theorem for the problem of counting homomorphisms to directed acyclic graphs. $H$ is a fixed directed acyclic graph. The problem is, given an input digraph $G$, how many homomorphisms are there from $G$ to $H$. We give a graph-theoretic classification, showing that for some digraphs $H$, ...
more >>>