Archiv kolokvií
Kolokviální přednáška - Phan Thành Nam - 27.9.2023 PDF Tisk

Posluchárna M1, 16:00, 27. září 2023

Speaker: Phan Thành Nam

Title: Isoperimetric inequalities and the critical mass in nuclear fission

Abstract: I will discuss the connection from classical isoperimetric inequalities to the critical mass in nuclear fission reactions described via the liquid drop model. In particular, I will address several open questions and recent results on the existence/nonexistence of minimizers according to the change of the nuclear mass.

Phan Thành Nam is a Vietnamese mathematician and mathematical physicist and university professor at the Ludwig Maximilian University of Munich.
Phan Thành Nam studied mathematics and computer science from 2003 at the National University of Vietnam in Ho Chi Minh City, where he received a  bachelor's degree in 2007, at the University of Orleans with a master's degree in 2008, and at the University of Copenhagen, where he joined in 2011 Jan Philip Solovej received his doctorate. As a post-doctoral student he worked with Mathieu Lewin at the University of Cergy-Pontoise and the CNRS until 2013 and at the Institute of Science and Technology Austria (IST) with Robert Seiringer until 2016. In 2016 he became an assistant professor at Masaryk University and in 2017 a professor at the University of Munich.
He deals with mathematical physics (many-body quantum mechanics, spectral theory), calculus of variations and partial differential equations as well as numerical analysis.
In 2018 he received the IUPAP Prize for Young Scientists in Mathematical Physics. For 2020/21 he received the EMS Prize (lecture: Excitation spectrum of dilute trapped Bose gases).

Aktualizováno Pondělí, 18 Září 2023 15:10
Kolokvium - 22.3. 2023 od 16:00 v M1 PDF Tisk

Kolokviální přednáška proběhne 22.3.2023 od 16:00 v posluchárně M1.

Jon Noel

Title: Squaring the Circle with Simple Pieces

Is it possible to partition a disk in the plane into finitely many pieces and re-assemble those pieces via isometries to yield a partition of a square? This question was asked by Tarski back in 1925 and answered in the affirmative by Laczkovich some 65 years later.
Laczkovich's proof uses the Axiom of Choice in a strong way; as a  result, the pieces of his partition are very hard to imagine. In 2017, two new proofs emerged which achieve pieces that are Lebesgue measurable or even Borel; the latter result is fully "constructive." We improve on these results by constructively achieving pieces which have (a) lower Borel complexity and (b) "small" boundaries. A benefit of the second condition is that the pieces of our partition are, in some sense, "visualizable." The proof uses basic concepts in graph theory, such as Eulerian tours, matchings and network flows. Based on joint work with András Máthé and Oleg Pikhurko.

Aktualizováno Pondělí, 20 Březen 2023 16:03