sam

scipy-conference · Oct 30, 2024 · fe577d6 · fe577d6
1 parent e9d9f39
commit fe577d6
Show file tree

Hide file tree

Showing 5 changed files with 3 additions and 3 deletions.
diff --git a/papers/matthew_feickert/full_text.pdf b/papers/matthew_feickert/full_text.pdf
diff --git a/papers/matthew_feickert/meca.zip b/papers/matthew_feickert/meca.zip
diff --git a/papers/sam_morley/full_text.pdf b/papers/sam_morley/full_text.pdf
diff --git a/papers/sam_morley/main.md b/papers/sam_morley/main.md
@@ -539,10 +539,10 @@ RoughPy streams cache the result of log-signature queries over dyadic intervals
 so they can be reused in later calculations. To compute the log-signature over
 any interval $I$, we granularise at a fixed stream resolution $n$ to obtain the
 interval $\tilde I = [k_1/2^n, k_2/2^n)$, and then compute
-:::{math}
-\mathrm{LogSig}(\tilde I) = \log\biggl(\prod\_{k=k_1}^{k_2-1}
+```{math}
+\mathrm{LogSig}(\tilde{I}) = \log\biggl(\prod_{k=k_1}^{k_2-1} 
 \exp(\mathrm{LogSig}(D_k^n))\biggr).
-:::
+```
 The $\mathrm{LogSig}(D_k^n)$ terms on the right-hand-side are either retrieved
 from the cache, or computed from the underlying source. This is essentially the
 Campbell-Baker-Hausdorff formula applied to the log-signatures at the finest

diff --git a/papers/sam_morley/meca.zip b/papers/sam_morley/meca.zip