Events for 12/03/2020 from all calendars

Probability Seminar

Time: 09:00AM - 10:00AM

Location: Zoom

Speaker: Alexandros Eskenazis, Trinity College (University of Cambridge)

Title: On Talagrand’s influence inequality (part II)

Abstract: Talagrand's influence inequality (1994) is an asymptotic improvement of the classical $L_2$ Poincaré inequality on the Hamming cube $\{-1,1\}^n$ with numerous applications to Boolean analysis, discrete probability theory and geometric functional analysis. In these talks, we shall discuss various refinements of Talagrand's inequality, including its $L_p$ analogues and Banach space-valued versions. Emphasis will be given to the probabilistic aspects of the proofs. We will also explain a geometric application of these new refinements to the bi-Lipschitz embeddability of a natural family of finite metrics and mention related open problems.

Seminar on Banach and Metric Space Geometry

Time: 09:00AM - 09:50AM

Location: online seminar

Speaker: Alexandros Eskenazis, Trinity College, University of Cambridge

Title: On Talagrand’s influence inequality (part II)

Abstract: Talagrand's influence inequality (1994) is an asymptotic improvement of the classical L₂ Poincaré inequality on the Hamming cube {-1,1}ⁿ with numerous applications to Boolean analysis, discrete probability theory and geometric functional analysis. In these talks, we shall discuss various refinements of Talagrand's inequality, including its L_p analogues and Banach space-valued versions. Emphasis will be given to the probabilistic aspects of the proofs. We will also explain a geometric application of these new refinements to the bi-Lipschitz embeddability of a natural family of finite metrics and mention related open problems.

Student/Postdoc Working Geometry Seminar

Time: 10:45AM - 12:00PM

Location: zoom

Speaker: JM Landsberg, TAMU

Title: Introduction to Bott-Borel-Weil Thm.

Colloquium - Eric Ramos

Time: 1:00PM - 2:00PM

Location: Zoom

Speaker: Eric Ramos, University of Oregon

Description:

Title: The graph minor theorem, and graph configuration spaces
Abstract: Perhaps one of the most well-known theorems in graph theory is the celebrated Graph Minor Theorem of Robertson and Seymour. This theorem states that in any infinite collection of finite graphs, there must be a pair of graphs for which one is obtained from the other by a sequence of edge contractions and deletions. In this talk, I will present work of Nick Proudfoot, Dane Miyata, and myself which proves a categorified version of the graph minor theorem. As an application, we show how configuration spaces of graphs must display some strongly uniform properties. We then show how this result can be seen as a vast generalization of a variety of classical theorems in graph configuration spaces.