Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
seminars [2026-01-01] – [Extensions of the skein algorithm for link polynomials I] Martin Zieglerseminars [2026-03-10] (current) – Martin Ziegler
Line 15: Line 15:
  
 ===== 2026 ===== ===== 2026 =====
 +
 +====Extensions of the skein algorithm for link polynomials II====
 +  * March 10, 9h KST
 +  * N1 #422 and online
 +  * Alexander Stoimenov
 +
 +This talk continues explanation about the Millett-Ewing skein algorithm for link polynomials
 +and subsequent modifications and extensions. Plan is: \\
 +I. Details of the Millett-Ewing skein algorithm\\
 +II. The Stack\\
 +III. Alexander-variable truncations\\
 +IV. Parallelizing \\
 +V. Applications to quasipositivity \\
 +VI. Braid-skein algorithm and non-Alexander variable truncations 
  
 ====Extensions of the skein algorithm for link polynomials I==== ====Extensions of the skein algorithm for link polynomials I====
Line 22: Line 36:
  
 This talk gives some explanation about the Millett-Ewing skein algorithm for link polynomials This talk gives some explanation about the Millett-Ewing skein algorithm for link polynomials
-and subsequent modifications and extensions. Plan is: +and subsequent modifications and extensions. Plan is:\\ 
-  - Details of the Millett-Ewing skein algorithm +I. Details of the Millett-Ewing skein algorithm\\ 
-  - The Stack +II. The Stack\\ 
-  - Alexander-variable truncations +III. Alexander-variable truncations\\ 
-  - Parallelizing +IV. Parallelizing \\ 
-  - Applications to quasipositivity +V. Applications to quasipositivity \\ 
-  - Braid-skein algorithm and non-Alexander variable truncations +VI. Braid-skein algorithm and non-Alexander variable truncations 
  
 ===== 2025 ===== ===== 2025 =====