A Matrix for Counting Paths in Acyclic Colored Digraphs
摘要
In this paper, we generalize a theorem of R. P. Stanley regarding the enumeration of paths in acyclic digraphs.