Complexity and Real Computation Laboratory

This shows you the differences between two versions of the page.

--- seminars [2025-08-12] – [XpLUTo: Modelling Bulk Parallel Processing in RAM via Lookup Tables] Martin Ziegler
+++ seminars [2026-01-01] (current) – [Extensions of the skein algorithm for link polynomials I] Martin Ziegler
@@ Line 1: / Line 1: @@
 ====== Seminar on Theoretical Computer Science, Logic, and Real Computation ======
+  * [[Seminars#2026]]
   * [[Seminars#2025]]
   * [[Seminars#2024]]
@@ Line 12: / Line 13: @@
   * [[Seminars#2016]]
   * [[Seminars#2015]]
+===== 2026 =====
+====Extensions of the skein algorithm for link polynomials I====
+  * January 15, 14h KST
+  * N1 #422 and online
+  * Alexander Stoimenov
+This talk gives some explanation about the Millett-Ewing skein algorithm for link polynomials
+and subsequent modifications and extensions. Plan is:
+  - Details of the Millett-Ewing skein algorithm
+  - The Stack
+  - Alexander-variable truncations
+  - Parallelizing
+  - Applications to quasipositivity
+  - Braid-skein algorithm and non-Alexander variable truncations
 ===== 2025 =====
+====Computing with the Millett-Ewing notation====
+  * December 12, 11am KST
+  * N1 #422
+  * Alexander Stoimenov (Dongguk U)
+This talk gives some introduction about the notation of link diagrams developed by Millett-Ewing in the late 80s for calculating link polynomials.
+I explain how this notation is used by Knotscape (for this see [[https://www.youtube.com/watch?v=2_33U4Rdx5c|my previous tutorial]]) and in some related tools,
+before giving some details on the Millett-Ewing algorithm and (my) several subsequent modifications and extensions.
 ====XpLUTo: Modelling Bulk Parallel Processing in RAM via Lookup Tables====

Differences