Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| seminars [2025-12-05] – [Computing with the Millett-Ewing notation] Martin Ziegler | seminars [2026-03-29] (current) – [Extensions of the skein algorithm for link polynomials 3] Martin Ziegler | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Seminar on Theoretical Computer Science, Logic, and Real Computation ====== | ====== Seminar on Theoretical Computer Science, Logic, and Real Computation ====== | ||
| + | * [[Seminars# | ||
| * [[Seminars# | * [[Seminars# | ||
| * [[Seminars# | * [[Seminars# | ||
| Line 12: | Line 13: | ||
| * [[Seminars# | * [[Seminars# | ||
| * [[Seminars# | * [[Seminars# | ||
| + | |||
| + | ===== 2026 ===== | ||
| + | |||
| + | ====Extensions of the skein algorithm for link polynomials 3==== | ||
| + | * April 21, 9:15am 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. | ||
| + | |||
| + | |||
| + | ====Extensions of the skein algorithm for link polynomials 2==== | ||
| + | * 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. \\ | ||
| + | I. Applying the Morton-Franks-Williams inequality (and cables) \\ | ||
| + | web resource: [[https:// | ||
| + | II. The Stack (continuation from last time and conclusion) | ||
| + | |||
| + | ====Extensions of the skein algorithm for link polynomials 1==== | ||
| + | * 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:\\ | ||
| + | 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 | ||
| ===== 2025 ===== | ===== 2025 ===== | ||
| ====Computing with the Millett-Ewing notation==== | ====Computing with the Millett-Ewing notation==== | ||
| - | * December 12, time TBD | + | * December 12, 11am KST |
| - | * N1 #422 or #110 | + | * N1 #422 |
| * Alexander Stoimenov (Dongguk U) | * Alexander Stoimenov (Dongguk U) | ||