aboutsummaryrefslogtreecommitdiff
path: root/posts/2014-04-01-q-robinson-schensted-symmetry-paper.org
diff options
context:
space:
mode:
Diffstat (limited to 'posts/2014-04-01-q-robinson-schensted-symmetry-paper.org')
-rw-r--r--posts/2014-04-01-q-robinson-schensted-symmetry-paper.org2
1 files changed, 1 insertions, 1 deletions
diff --git a/posts/2014-04-01-q-robinson-schensted-symmetry-paper.org b/posts/2014-04-01-q-robinson-schensted-symmetry-paper.org
index b1c967d..7411a5d 100644
--- a/posts/2014-04-01-q-robinson-schensted-symmetry-paper.org
+++ b/posts/2014-04-01-q-robinson-schensted-symmetry-paper.org
@@ -10,7 +10,7 @@ approach, which uses "growth graphs", can also be applied to a wider
class of insertion algorithms which have a branching structure.
#+caption: Growth graph of q-RS for 1423
-[[../assets/resources/1423graph.jpg]]
+[[../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}\).