|
Date Time |
Location | Speaker |
Title – click for abstract |
 |
02/20 10:00am |
ZOOM |
Paul Simanjuntak Texas A&M University |
Two Looks at Strassen’s Theorem
In 1965 Strassen proved the remarkable result that if a random variable on a partially-ordered complete metric space stochastically dominates another (in a weak sense), then there is a coupling on the product space where the domination happens almost surely, i.e. pointwise. We will present a modern proof of this theorem, based on the Hahn-Banach theorem.
For the second look, we will show that Strassen’s theorem on finite space is equivalent to another famous theorem in combinatorics, the Hall Marriage Theorem. In turn, this proves the equivalence with the general theorem using approximation with finite groups. As a result, we may generalization of Strassen’s theorems for coupling conditions beyond domination. Based on papers of T. Lindvall (1999) and T. Koperberg (2024). |
 |
03/06 10:00am |
ZOOM |
Chris Gartland UC San Diego |
Lipschitz Extensions, Random Partitions, and Stochastic Embeddings into Ultrametric Spaces. Part II
The is a followup on a previous BMSG talk given by the speaker last semester. We will discuss recent developments and address some of the questions raised during that talk. |
 |
03/20 10:00am |
ZOOM |
Cosmas Kravaris Princeton University |
On the universal travelling salesman problem on the unit square
Given a set S of n points on the unit square [0,1]^2, the travelling salesman problem asks for the shortest length of the curve that passes through all the points in S. In the 1980s Bartholdi and Platzman introduced the universal travelling salesman heuristic which gives an approximate solution as follows. Take the Hilbert space-filling curve and define a linear order on [0,1]^2 by setting p |
 |
04/03 10:00am |
BLOC 302 |
Garett Tresch Texas A&M University |
Transportation Cost Spaces and Stochastic Trees
Given a finite metric space $M$ one can define the corresponding transportation cost space $\mathcal{F}(M)$ as the normed linear space of transportation problems on $M$. Roughly speaking, a transportation problem can be understood as a supply/demand configuration on $M$ where the norm of the transportation problem is the lowest cost of transporting goods from locations with a surplus to those with shortages. In this setting, an important line of research is studying the relation between transportation cost spaces and $\ell_1$. A core problem posed by S. Dilworth, D. Kutzarova, and M. Ostrovskii is finding a condition on a metric space $M$ equivalent to $\mathcal{F}(M)$ being Banach-Mazur close to $\ell_1^N$ in the corresponding dimension.
In this talk, we discuss our recent work where a partial solution to this problem is obtained by examining tree-like structure within the underlying metric space. Tangential to this result, we have also developed a new technique that, potentially, could serve as a step toward a complete solution to the problem of Dilworth, Kutzarova, and Ostrovskii. We conclude by discussing two applications of this technique: finding an asymptotically tight upper bound of the $\ell_1^N$-distortion of the Laakso graphs, and proving that finite hyperbolic approximations of doubling metric spaces have uniformly bounded $\ell_1^N$-distortion. This is joint work with Ruben Medina. |
 |
05/01 09:00am |
BLOC 139 |
Workshop website |
STEaLTH Workshop: Coarse Geometry of the Heisenberg Group
The goal of this STEaLTH Workshop is to provide an exposition on coarse compression and bi-Lipschitz distortion estimates when embedding Heisenberg group into super-reflexive Banach spaces. The material is taken from the paper ``Sharp quantitative nonembeddability of the Heisenberg group into superreflexive Banach spaces'' (Groups Geom. Dyn. 7 (2013), 497–522) by T. Austin, A. Naor, and R. Tessera. Only a very basic knowledge of functional analysis is required to be able to follow the workshop. The proof will be broken into several stand-alone vignette-talks given by Audrey Fovelle (Universidad de Granada), Alain Valette (Université de Neuchâtel), and Florent Baudier (Texas A&M University)
|