Fix definition of \beta and \log^*.

diff --git a/adv.tex b/adv.tex
index 155bd987dcadd4f10fc32519efae35903dbf015f..400b8a01da9ad197deb9f750f4961c0d513edd96 100644 (file)
--- a/adv.tex
+++ b/adv.tex
@@ -376,7 +376,7 @@ how the algorithm could have stopped growing the tree~$R_i^j$:
 
 \thm\id{itjarthm}%
 The Iterated Jarn\'\i{}k's algorithm finds the MST of the input graph in time
-$\O(m\timesbeta(m,n))$, where $\beta(m,n):=\min\{ i: \log^{(i)}n < m/n \}$.
+$\O(m\timesbeta(m,n))$, where $\beta(m,n):=\min\{ i: \log^{(i)}n \le m/n \}$.
 
 \proof
 Phases are finite and in every phase at least one edge is contracted, so the outer

diff --git a/notation.tex b/notation.tex
index 80ebe3fa58a543b6c922d40e53bf1d05eaee9f25..5517660d1de753e53facc2cccf3d9e2c0669fd2a 100644 (file)
--- a/notation.tex
+++ b/notation.tex
@@ -39,8 +39,8 @@
 \n{$\log n$}{a binary logarithm of the number~$n$}
 \n{$f^{(i)}$}{function~$f$ iterated $i$~times: $f^{(0)}(x):=x$, $f^{(i+1)}(x):=f(f^{(i)}(x))$}
 \n{$2\tower n$}{the tower function (iterated exponential): $2\tower 0:=1$, $2\tower (n+1):=2^{2\tower n}$}
-\n{$\log^* n$}{the iterated logarithm: $\log^*n := \min\{i: \log^{(i)}n < 1\}$; the inverse of~$2\tower n$}
-\n{$\beta(m,n)$}{$\beta(m,n) := \min\{i: \log^{(i)}n < m/n \}$ \[itjarthm]}
+\n{$\log^* n$}{the iterated logarithm: $\log^*n := \min\{i: \log^{(i)}n \le 1\}$; the inverse of~$2\tower n$}
+\n{$\beta(m,n)$}{$\beta(m,n) := \min\{i: \log^{(i)}n \le m/n \}$ \[itjarthm]}
 \n{$W$}{word size of the RAM \[wordsize]}
 \n{$\(x)$}{number~$x\in{\bb N}$ written in binary \[bitnota]}
 \n{$\(x)_b$}{$\(x)$ zero-padded to exactly $b$ bits \[bitnota]}