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-03-02] – [Extensions of the skein algorithm for link polynomials II] Martin Zieglerseminars [2026-03-10] (current) – Martin Ziegler
Line 22: Line 22:
  
 This talk continues explanation about the Millett-Ewing skein algorithm for link polynomials This talk continues explanation about the Millett-Ewing skein algorithm for link polynomials
-and subsequent modifications and extensions. Plan is: +and subsequent modifications and extensions. Plan is: \\ 
-  3. Alexander-variable truncations +I. Details of the Millett-Ewing skein algorithm\\ 
-  4. Parallelizing +II. The Stack\\ 
-  5. Applications to quasipositivity +III. Alexander-variable truncations\\ 
-  6. Braid-skein algorithm and non-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 35: 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\\ 
 +IV. Parallelizing \\ 
 +V. Applications to quasipositivity \\ 
 +VI. Braid-skein algorithm and non-Alexander variable truncations  
 ===== 2025 ===== ===== 2025 =====