A multiset version of determinants and the Coin arrangements lemma

In this paper, we first give a multiset version of the graph-theoretical interpretation of the classic determinant of a matrix A based on a multiset generalization of the cycle cover of its associated digraph D ( A ) . Then, as a direct consequence of this interpretation, we present another algebraic proof of a weighted version of the original coin arrangements lemma.