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

Sturmian edits
All checks were successful
CI / Typst formatting (pull_request) Successful in 9s
Details
CI / Typos (pull_request) Successful in 53s
Details
CI / Build (pull_request) Successful in 6m35s
Details
CI / Typst formatting (push) Successful in 5s
Details
CI / Typos (push) Successful in 12s
Details
CI / Build (push) Successful in 6m35s
Details

Browse Source
This commit was merged in pull request #31.
This commit is contained in:
Mark
2026-03-15 08:01:16 -07:00
parent 7cb1f04fb4
commit 22f53be42d
2 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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}