From 4e57cba684ba94a8f631d5fe1f24ba285c2a27df Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Sat, 13 Sep 2008 17:08:45 +0200 Subject: [PATCH] Removed further references to ranks. --- notation.tex | 1 - ram.tex | 3 +-- 2 files changed, 1 insertion(+), 3 deletions(-) diff --git a/notation.tex b/notation.tex index c515b49..4a26a3e 100644 --- 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 ac0a4ac..e2609ba 100644 --- 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 = \(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 -- 2.39.2