From 22f53be42d34422b49c6c049ec6f1405096e15aa Mon Sep 17 00:00:00 2001 From: Mark Date: Sun, 15 Mar 2026 08:01:16 -0700 Subject: [PATCH] Sturmian edits --- src/Advanced/De Bruijn/parts/3 line.tex | 1 - src/Advanced/De Bruijn/parts/4 sturmian.tex | 2 +- 2 files changed, 1 insertion(+), 2 deletions(-) diff --git a/src/Advanced/De Bruijn/parts/3 line.tex b/src/Advanced/De Bruijn/parts/3 line.tex index 0454474..7ec93d0 100644 --- a/src/Advanced/De Bruijn/parts/3 line.tex +++ b/src/Advanced/De Bruijn/parts/3 line.tex @@ -49,7 +49,6 @@ Have an instructor check your solution. (0) edge (2) (2) edge (3) (2) edge[bend left] (4) - (4) edge[bend left] (2) (3) edge (1) (4) edge (3) (4) edge[loop right] (4) diff --git a/src/Advanced/De Bruijn/parts/4 sturmian.tex b/src/Advanced/De Bruijn/parts/4 sturmian.tex index 97b87f0..9a51de6 100644 --- a/src/Advanced/De Bruijn/parts/4 sturmian.tex +++ b/src/Advanced/De Bruijn/parts/4 sturmian.tex @@ -375,7 +375,7 @@ Construct a minimal Sturmain word of order 5. \problem{} -Argue that the words we get by \ref{sturmanthm} are minimal Sturmain words. \par +Show that the words we get by \ref{sturmanthm} are minimal Sturmain words. \par That is, the word $w$ has length $2n$ and $\mathcal{S}_m(w) = m + 1$ for all $m \leq n$. \begin{solution}