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-10] – Martin Zieglerseminars [2026-09-12] (current) – [Introduction to OSCAR] Martin Ziegler
Line 16: Line 16:
 ===== 2026 ===== ===== 2026 =====
  
-====Extensions of the skein algorithm for link polynomials II====+====Introduction to OSCAR==== 
 +  * September 18, 15h30 KST 
 +  * N1 #422  
 +  * Sehun Park (KAIST) 
 + 
 + 
 + 
 +====Extensions of the skein algorithm for link polynomials 2====
   * March 10, 9h KST   * March 10, 9h KST
   * N1 #422 and online   * N1 #422 and online
Line 22: Line 29:
  
 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. \\ 
-I. Details of the Millett-Ewing skein algorithm\\ +I. Applying the Morton-Franks-Williams inequality (and cables) \\ 
-II. The Stack\\ +web resource: [[https://stoimenov.net/stoimeno/homepage/ptab/16_1057125_text/16_1057125_info.html|https://stoimenov.net/stoimeno/homepage/ptab/16_1057125_text/16_1057125_info.html]] \\ 
-III. Alexander-variable truncations\\ +II. The Stack (continuation from last time and conclusion)
-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 1====
   * January 15, 14h KST   * January 15, 14h KST
   * N1 #422 and online   * N1 #422 and online