aboutsummaryrefslogtreecommitdiff
path: root/posts/2014-04-01-q-robinson-schensted-symmetry-paper.md
diff options
context:
space:
mode:
Diffstat (limited to 'posts/2014-04-01-q-robinson-schensted-symmetry-paper.md')
-rw-r--r--posts/2014-04-01-q-robinson-schensted-symmetry-paper.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/posts/2014-04-01-q-robinson-schensted-symmetry-paper.md b/posts/2014-04-01-q-robinson-schensted-symmetry-paper.md
index 38874bb..a0432c8 100644
--- a/posts/2014-04-01-q-robinson-schensted-symmetry-paper.md
+++ b/posts/2014-04-01-q-robinson-schensted-symmetry-paper.md
@@ -13,7 +13,7 @@ generalisation of the growth diagram approach introduced by Fomin. This
approach, which uses "growth graphs", can also be applied to a wider
class of insertion algorithms which have a branching structure.
-![Growth graph of q-RS for 1423](../assets/resources/1423graph.jpg)
+![Growth graph of q-RS for 1423](../assets/1423graph.jpg)
Above is the growth graph of the \\(q\\)-weighted Robinson-Schensted
algorithm for the permutation \\({1 2 3 4\\choose1 4 2 3}\\).