[go: nahoru, domu]
Home » Events

Upcoming conferences & activities

Posted in

Workshop on "Dualisable Categories $\&$ Continuous $K$-theory"

Posted in
Organiser(s): 
Tobias Barthel, Kaif Hilman, Dominik Kirstein and Jonas McCandless
Date: 
Mon, 09/09/2024 - 09:00 - Fri, 13/09/2024 - 15:00
Location: 
MPIM Lecture Hall
Details: 
Program and Abstracts of Workshop on "Dualisable Categories $\&$ Continuous $K$-theory"

Workshop on "Dualisable Categories & Continuous K-theory", September 9 - 13, 2024

Algebraic K-theory is an object that sits at the centre of large parts of algebra, geometry, and topology because of its universal role as a receptacle to count other mathematical objects with signs. However, since its invention, a phenomenon often called the Eilenberg swindle - which says that the algebraic K-theory of a category which is too large must necessarily be zero - has been accepted as a fundamental limit to the theory.

Workshop on "Unstable Homotopy Theory"

Posted in
Organiser(s): 
Tobias Barthel, Yuqing Shi
Date: 
Mon, 11/11/2024 - 09:00 - Fri, 15/11/2024 - 15:00
Location: 
MPIM Lecture Hall
Details: 
Program and Abstracts of Workshop on "Unstable Homotopy Theory"

Workshop on "Unstable Homotopy Theory", November 11 - 15, 2024

Unstable homotopy theory is about understanding the detailed structure and properties of topological spaces and morphisms between them. Central to this study is the concept of homotopy types (also known as ∞-groupoids, animas, or spaces), which classify topological spaces up to weak homotopy equivalence.

Conference on "The Mathematics of Post-Quantum Cryptography"

Posted in
Organiser(s): 
Eleni Agathocleous (MPIM), Stephan Ehlen (BSI), Joanna Meinel (BSI), Pieter Moree (MPIM)
Date: 
Wed, 04/12/2024 - 09:00 - Thu, 05/12/2024 - 15:00
Location: 
MPIM Lecture Hall
Details: 
Program and Abstracts of Conference on "The Mathematics of Post-Quantum Cryptography"

Conference on "The Mathematics of Post-Quantum Cryptography", December 4 - 5, 2024

Post-Quantum cryptography is a branch of public-key cryptography aiming to design
cryptographic schemes building on mathematical problems that are conjectured to be hard
to solve on both, classical and quantum computers. Such cryptographic schemes are needed
since Shor's quantum algorithms break classical public-key cryptography based on the
discrete logarithm problem (in finite fields or elliptic curves) as well as integer factoring in polynomial

© MPI f. Mathematik, Bonn Impressum & Datenschutz
-A A +A