Removed further references to ranks.

diff --git a/notation.tex b/notation.tex
index c515b4987818e553d26c0feec616a7627d35cbed..4a26a3e89eca0c2a59d48a50ab212198c324cdb4 100644 (file)
--- a/notation.tex
+++ b/notation.tex
@@ -80,7 +80,6 @@
 \n{$H\minorof G$}{$H$ is a~minor of~$G$ \[minordef]}
 \n{$G\crpt R$}{graph~$G$ with edges in~$R$ corrupted \[corrnota]}
 \n{$R^C$}{$R^C = R\cap \delta(C)$ \[corrnota]}
-\n{$M^{i,j}$}{the matrix $M$ with $i$-th row and $j$-th column deleted \[restnota]}
 
 }
 

diff --git a/ram.tex b/ram.tex
index ac0a4acbb1a47936a0c459633abb3aad11bfccbe..e2609ba986318f31221400b3a10af1434939de89 100644 (file)
--- a/ram.tex
+++ b/ram.tex
@@ -914,8 +914,7 @@ the real definition of the Q-heap from it.
 indexed in a~way that $x_1 < \ldots < x_n$,
 \:$g_i = \<MSB>(x_i \bxor x_{i+1})$ --- the position of the most significant bit in which $x_i$ and~$x_{i+1}$ differ,
 \:$R_X(x)$ --- the rank of~$x$ in~$X$, that is the number of elements of~$X$ which are less than~$x$
-(where $x$~itself need not be an~element of~$X$).\foot{We will dedicate the whole Chapter~\ref{rankchap} to the
-study of various ranks.}
+(where $x$~itself need not be an~element of~$X$).
 \endlist
 
 \defn