Mark/handouts
1
1
Fork 0
Code Pull Requests 2 Actions Packages Releases Activity

edits #31

Merged
Mark merged 4 commits from edits into main 2026-03-15 08:11:08 -07:00
Conversation 0 Commits 4 Files Changed 8 +1 -2
2 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Showing only changes of commit 22f53be42d - Show all commits

1
src/Advanced/De Bruijn/parts/3 line.tex
View File

@@ -49,7 +49,6 @@ Have an instructor check your solution.
(0) edge (2) (0) edge (2)
(2) edge (3) (2) edge (3)
(2) edge[bend left] (4) (2) edge[bend left] (4)
(4) edge[bend left] (2)
(3) edge (1) (3) edge (1)
(4) edge (3) (4) edge (3)
(4) edge[loop right] (4) (4) edge[loop right] (4)

2
src/Advanced/De Bruijn/parts/4 sturmian.tex
View File

@@ -375,7 +375,7 @@ Construct a minimal Sturmain word of order 5.
\problem{} \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$. That is, the word $w$ has length $2n$ and $\mathcal{S}_m(w) = m + 1$ for all $m \leq n$.
\begin{solution} \begin{solution}