TMD Genel Seminerleri 2022-2023


Türk Matematik Derneği matematiğin tüm alanlarını kapsayan genel seminer serisine devam ediyor. Çevrimiçi seminerlerin pandemi dolayısı ile yaygınlaşması bizlere dünyanın seçkin matematikçilerini Turkiye’deki çevrimiçi seminerlere davet etme olanağını sağlıyor. Bu seminer serisi ile Türkiye’de çalışan matematikçilerin dünyadaki matematik alanındaki son gelişmeleri daha yakından takip etmelerini kolaylaştırmayı hedefliyoruz.

(TMD Genel Seminerleri 2021-2022 sayfası için tıklayın.)

Organizasyon Komitesi

Erhan Bayraktar (U. Michigan), İlker Birbil (U. Amsterdam), Kazım Büyükboduk (UC-Dublin), İzzet Coşkun (U. Illinois – Chicago), Barış Coşkunüzer (UT Dallas), Burak Erdoğan (U. Illinois – Urbana-Champaign), Sinan Güntürk (NYU-Courant), Özlem İmamoğlu (ETH Zürich), Gizem Karaali (Pomona C.), Ekin Özman (Boğaziçi U.), Özgür Yılmaz (University of British Columbia).

1. Konuşma

Tarih : 20 Eylül 2022 Salı
12:00 (New York) / 17:00 (Londra) / 19:00 (İstanbul)

Konuşmacı : METE SONER – Princeton University

Başlık : OPTIMAL CONTROL

Özet : Starting with the moon-landing problem, the mathematical theory of  optimal control has been fully developed and found numerous applications not only in engineering but also in many subfields of social sciences. In particular, in economics and quantitative finance, stochastic optimal control has become a  central modeling tool, and is the starting point for many modern learning algorithms.  The unifying paradigm is decisions under uncertainty and one imagines that a rational decision maker is guided by an appropriate control problem.  In this talk, after describing the structure of the general problem, I will outline the powerful solution technique based on dynamic programming.  Several applications such as the Kalman filter used in automated machines,  Merton’s problem for optimal investment decisions and the Ellsberg experiment for uncertainty will also be discussed.  I will conclude with the new developments and the questions.

Poster 👆

Zoom Bağlantısı 👆

Konuşmanın Kaydı 👆

2. Konuşma

Tarih : 18 Ekim 2022 Salı

9:30 (New York), 14:30 (Londra), 16:30 (Istanbul)

Konuşmacı : BJORN POONEN – Massachusetts Institute of Technology

Başlık : UNDECIDABILITY IN NUMBER THEORY

Özet : Hilbert’s tenth problem asked for an algorithm that, given a multivariable polynomial equation with integer coefficients, would decide whether there exists a solution in integers.  Around 1970, Matiyasevich, building on earlier work of Davis, Putnam, and Robinson, showed that no such algorithm exists.  But the answer to the analogous question with integers replaced by rational numbers is still unknown, and there is not even agreement among experts as to what the answer should be.

Poster 👆

Zoom Bağlantısı 👆

Konuşmanın Kaydı 👆

3. Konuşma

Tarih : 15 Kasım 2022

10:00 (New York), 15:00 (Londra), 18:00 (Istanbul)

Konuşmacı : ISABEL VOGT – Brown University

Başlık : INTERPOLATION PROBLEMS FOR CURVES

Özet : The interpolation problem is one of the oldest in mathematics.  In its most broad form it asks: when can a curve of a given type be passed through a given number of points?  I’ll survey work on the interpolation problem from Euclid to the modern day, ending with recent joint work of mine with Eric Larson.

Poster 👆

Zoom Bağlantısı 👆

Konuşmanın Kaydı 👆

4. Konuşma

Tarih : 20 Aralık 2022 19:00

Konuşmacı : Maria Chudnovsky – Princeton University

Başlık : Induced Subgraphs and Tree Decompositions

Özet : Tree decompositions are a powerful tool in both structural graph theory and graph algorithms. Many hard problems become tractable if the input graph is known to have a tree decomposition of bounded “width”. Exhibiting a particular kind of a tree decomposition is also a useful way to describe the structure of a graph. Tree decompositions have traditionally been used in the context of forbidden graph minors; bringing them into the realm of forbidden induced subgraphs has until recently remained out of reach. Over the last couple of years we have made significant progress in this direction, exploring both the classical notion of bounded tree-width, and concepts of more structural flavor. This talk will survey some of these ideas and results.

Poster 👆

Zoom Bağlantısı 👆

Konuşmanın Kaydı 👆

5. Konuşma

Tarih : 20 Ocak 2023 19:00

Konuşmacı :Larry Guth – Massachusetts Institute of Technology

Başlık : Introduction to decoupling in Fourier analysis

Özet : Decoupling is a recent development in Fourier analysis which has led to solutions of a number of longstanding problems in harmonic analysis, PDE, and analytic number theory.  In this talk, we will try to give a broad introduction to the subject.  We’ll start by describing an old problem from analytic number theory which has been solved using decoupling.  Then we will describe some of the tools of the proof.

Poster 👆

Zoom Bağlantısı 👆

Konuşmanın Kaydı 👆

6. Konuşma

Tarih : 9 Şubat 2023 19:00

Konuşmacı : Ingrid Daubechies – Duke University

Başlık : Discovering low-dimensional manifolds in high-dimensional data sets

Özet : Diffusion methods help understand and denoise data sets; when there is additional structure (as is often the case), one can use (and get additional benefit from) a fiber bundle model.

This talk reviews diffusion methods to identify low-dimensional manifolds underlying high-dimensional datasets, and illustrates that by pinpointing additional mathematical structure, improved results can be obtained. Much of the talk draws on a case study from a collaboration with biological morphologists, who compare different phenotypical structures to study relationships of living or extinct animals with their surroundings and each other. This is typically done from carefully defined anatomical correspondence points (landmarks) on e.g. bones; such landmarking draws on highly specialized knowledge. To make possible more extensive use of large (and growing) databases, algorithms are required for automatic morphological correspondence maps, without any preliminary marking of special features or landmarks by the user.

Poster 👆

Zoom Bağlantısı 👆

Konuşmanın Kaydı 👆












YouTube
YouTube