Added a Remark.

diff --git a/rank.tex b/rank.tex
index fe43933d28740f4a95bb7bb47c5b70ac2cb0316e..3005c42c9d6e60ee10437d84991c91e8dccb2da1 100644 (file)
--- a/rank.tex
+++ b/rank.tex
@@ -602,6 +602,11 @@ same number of vertices and also the same number of missing edges. As the
 number of matchings is an~isomorphism invariant, the lemma follows.
 \qed
 
+\rem
+There is a~clear combinatorial intuition behind this lemma: if we are
+to count permutations with restrictions placed on~$z$ elements and these
+restrictions are independent, it does not matter how exactly they look like.
+
 \defn
 Let $n_0(z,d)$ be the permanent shared by all submatrices as described
 by the above lemma, which have $d\times d$ entries and exactly~$z$ zeroes.