From: Martin Mares <mj@ucw.cz>
Date: Wed, 27 Feb 2008 19:56:39 +0000 (+0100)
Subject: Added a Remark.
X-Git-Tag: printed~208
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=38695a361ff79bd1a9afd420cab8ebadf29b5b5e;p=saga.git

Added a Remark.
---

diff --git a/rank.tex b/rank.tex
index fe43933..3005c42 100644
--- 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.