Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| seminars [2026-03-29] – [Extensions of the skein algorithm for link polynomials 3] Martin Ziegler | seminars [2026-09-29] (current) – [2026] Martin Ziegler | ||
|---|---|---|---|
| Line 16: | Line 16: | ||
| ===== 2026 ===== | ===== 2026 ===== | ||
| - | ====Extensions | + | ====NP-Completeness Proofs |
| - | * April 21, 9: | + | * September 29, 10h30am |
| - | * N1 #422 and online | + | * N1 #111 |
| - | * Alexander Stoimenov | + | * Suthee Ruangwises (Chulalongkorn University) |
| - | This talk continues explanation about the Millett-Ewing skein algorithm for link polynomials | ||
| - | and subsequent modifications and extensions. | ||
| + | ====Introduction to OSCAR==== | ||
| + | * September 23, 10am KST | ||
| + | * N1 #422 | ||
| + | * Sehun Park (KAIST) | ||
| + | The bit-cost of processing (say, continuous) real functions is exponentially more expensive than of single real numbers, but parallelizes well using Prefix Sum. | ||
| + | We introduce the open-source computer algebra system OSCAR and our first programming steps in Julia, including examples including Prefix Sum. | ||
| ====Extensions of the skein algorithm for link polynomials 2==== | ====Extensions of the skein algorithm for link polynomials 2==== | ||
| * March 10, 9h KST | * March 10, 9h KST | ||