From 1d0d0f02919c3e54c7559087945c7e9cf2adbef5 Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Fri, 22 Feb 2008 18:17:21 +0100 Subject: [PATCH] Minor fixes. --- PLAN | 1 - notation.tex | 1 - 2 files changed, 2 deletions(-) diff --git a/PLAN b/PLAN index a397476..ff4dd14 100644 --- a/PLAN +++ b/PLAN @@ -64,7 +64,6 @@ Models: Ranking: - the general perspective: is it only a technical trick? -- def. of ranking: do we need to write \prec explicitly? - move description of the ranking set to the chapter on models? - ranking of permutations on general sets, relationship with integer sorting diff --git a/notation.tex b/notation.tex index 1f74341..a572fe3 100644 --- a/notation.tex +++ b/notation.tex @@ -60,7 +60,6 @@ \n{$\bxor$}{bitwise non-equivalence: $(x\bxor y)[i]=1$ iff $x[i]\ne y[i]$} \n{$x \shl n$}{bitwise shift of~$x$ by $n$~positions to the left: $x\shl n = x\cdot 2^n$} \n{$x \shr n$}{bitwise shift of~$x$ by $n$~positions to the right: $x\shr n = \lfloor x/2^n \rfloor$} -\n{$\prec$}{an~arbitrary linear order} \n{$R_{C,\prec}(x)$}{the rank of~$x$ in a~set~$C$ ordered by~$\prec$ \[rankdef]} \n{$R^{-1}_{C,\prec}(i)$}{the unrank of~$i$: the $i$-th smallest element of a~set~$C$ ordered by~$\prec$ \[rankdef]} \n{$[n]$}{the set $\{1,2,\ldots,n\}$ \[pranksect]} -- 2.39.2