edits #31
@@ -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)
|
||||
|
||||
@@ -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}
|
||||
|
||||
Reference in New Issue
Block a user