Complexity and Real Computation Laboratory

This shows you the differences between two versions of the page.

--- seminars [2022-06-02] – [Computing with Infinite Objects via Coinductive Definitions] Martin Ziegler
+++ seminars [2024-09-25] (current) – [iRRAM for Knots] Martin Ziegler
@@ Line 1: / Line 1: @@
 ====== Seminar on Theoretical Computer Science, Logic, and Real Computation ======
+  * [[Seminars#2024]]
+  * [[Seminars#2023]]
   * [[Seminars#2022]]
   * [[Seminars#2021]]
@@ Line 10: / Line 12: @@
   * [[Seminars#2015]]
-===== 2022 =====
+===== 2024 =====
+====iRRAM for Knots====
+  * September 26, 11h00 KST
+  * hybrid offline (N1 #524) + online (Zoom, ask for coordinates)
+  * Jaden Jorradol (KAIST)
+Rehearsal for presentation of [[https://cs.kaist.ac.kr/research/techReport|KAIST Technical Report CS-TR-2024-428]] at [[https://www.lix.polytechnique.fr/CCC2024/|CCC'2024]].
+====Implementation of the Burau spectral test====
+  * June 4, 13h30 KST
+  * hybrid offline (N1 #422) + online (Zoom, ask for coordinates)
+  * Alexander Stoimenov (Dongguk University)
+  * Jaden Jorradol (KAIST)
+We use the spectrum of the Burau representation to introduce
+a series of tests for a braid being conjugate
+to a reducible braid, valid for every braid group.
+The method can be extended to exchangeable and
+composite braids and to Markov equivalence.
+We also determine the exact location of
+the eigenvalues of the Burau matrix (for suitable
+parameter), with those
+for reducible braids filling a complex disk and
+for the exchange move a Descartes oval.
+===== 2023 =====
+====Continuous Local Strategies for Robotic Formation Problems====
+===by Barbara Kempkes and Friedhelm Meyer auf der Heide (2012)===
+  * June 28, 19h KST
+  * Rakhman Ulzhalgas (KAIST)
+===== 2022 =====
 ====Computing with Infinite Objects via Coinductive Definitions====

Differences