A Counting Lemma and Multiple Combinatorial Stokesʹ Theorem

We prove in the present paper a counting lemma for bipartite digraphs which is useful in the combinatorics of pseudomanifolds. By an application of the lemma, we prove a multiple combinatorial Stokesʹ theorem, generalizing the 1967 Ky Fan combinatorial formula to multiple labelings.