Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| seminars [2025-12-08] – [Computing with the Millett-Ewing notation] 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 ====== | ====== 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 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 ===== | ===== 2025 ===== | ||