Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
seminars [2024-05-28] – [Implementation of the Burau spectral test] Martin Ziegler | seminars [2025-03-19] (current) – [Accelerating Operator Calculus] 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 11: | Line 12: | ||
* [[Seminars# | * [[Seminars# | ||
* [[Seminars# | * [[Seminars# | ||
+ | |||
+ | ===== 2025 ===== | ||
+ | |||
+ | ====Integer factorization of matrices and 4-dimensional genera of knots==== | ||
+ | * March 19, 9:15am KST | ||
+ | * N1 #601 | ||
+ | * Alexander Stoimenov (Dongguk U) | ||
+ | |||
+ | This is a lecture, in which I explain | ||
+ | the methods for computing (smooth) 4-dimensional genera of knots, | ||
+ | based on signatures | ||
+ | and Donaldson' | ||
+ | integer factorization of Goeritz matrices. Here I will talk | ||
+ | about how to efficiently implement the search for such | ||
+ | factorizations. | ||
+ | I plan to show Chuck Livingston' | ||
+ | my contributions to the computation of (smooth) 4-dimensional genera. | ||
+ | |||
+ | ====Automated Reasoning with Continuous Data==== | ||
+ | * March 19, 10:00am KST | ||
+ | * N1 #601 | ||
+ | * Margarita Korovina (IIS SB RAS) | ||
+ | |||
+ | In this talk we report on ongoing research on solving non-linear constraints | ||
+ | over the reals occurring in a wide range of applications, | ||
+ | verification, | ||
+ | of formally verified proofs of mathematical statements. In our framework | ||
+ | methods from Computable Analysis and Automated Reasoning are combined to | ||
+ | meet efficiency and expressiveness. This approach is applicable to a large number | ||
+ | of constraints involving computable non-linear functions, piecewise polynomial | ||
+ | splines, transcendental functions and solutions of polynomial differential equations. | ||
+ | We give an introduction to the **ksmt** calculus for checking satisfiability of | ||
+ | non-linear constraints in a CDCL style way inspired by advances in SAT solving. | ||
+ | Along proof search **ksmt** resolves two types of conflicts: linear and non-linear. | ||
+ | Linear conflicts are delegated to a decision procedure for linear real arithmetic | ||
+ | and non-linear conflicts are resolved by local linearisations separating the solution | ||
+ | set and the current conflict. We show that the ksmt calculus is a δ-complete | ||
+ | decision procedure for bounded problems. In this setting we discuss resent and | ||
+ | future research work. | ||
+ | |||
+ | ====From iRRAM to pyRRAM: Some thoughts on implementing real number arithmetic==== | ||
+ | * March 19, 10:45am KST | ||
+ | * N1 #601 | ||
+ | * Norbert Müller (Uni Trier) | ||
+ | |||
+ | Due to their uncountability, | ||
+ | completely | ||
+ | different compared to countable sets like the integer or even the | ||
+ | rational | ||
+ | numbers. In the talk we present basic ideas for implementations in | ||
+ | an existing | ||
+ | library written in C++ and in a derived current approach in | ||
+ | Python. | ||
+ | |||
===== 2024 ===== | ===== 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:// | ||
====Implementation of the Burau spectral test==== | ====Implementation of the Burau spectral test==== | ||
Line 18: | Line 80: | ||
* hybrid offline (N1 #422) + online (Zoom, ask for coordinates) | * hybrid offline (N1 #422) + online (Zoom, ask for coordinates) | ||
* Alexander Stoimenov (Dongguk University) | * Alexander Stoimenov (Dongguk University) | ||
+ | * Jaden Jorradol (KAIST) | ||
We use the spectrum of the Burau representation to introduce | We use the spectrum of the Burau representation to introduce |