Sturmian edits

2026-03-15 08:01:16 -07:00
parent 7cb1f04fb4
commit 22f53be42d
2 changed files with 1 additions and 2 deletions
--- a/src/Advanced/De
+++ b/src/Advanced/De
@@ -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)
--- a/src/Advanced/De
+++ b/src/Advanced/De
@@ -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}