Seminars and Colloquia by Series

Cotlar’s identity for Hilbert transforms---old and new stories.

Series
Analysis Seminar
Time
Wednesday, November 14, 2018 - 13:55 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Tao MeiBaylor University
Cotlar’s identity provides an easy (maybe the easiest) argument for the Lp boundedness of Hilbert transforms. E. Ricard and I discovered a more flexible version of this identity, in the recent study of the boundedness of Hilbert transforms on the free groups. In this talk, I will try to introduce this version of Cotlar’s identity and the Lp Fourier multipliers on free groups.

Estimating High-dimensional Gaussian Tails

Series
High Dimensional Seminar
Time
Wednesday, November 14, 2018 - 12:55 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Ben CousinsColumbia University

The following is a well-known and difficult problem in rare event simulation: given a set and a Gaussian distribution, estimate the probability that a sample from the Gaussian distribution falls outside the set. Previous approaches to this question are generally inefficient in high dimensions. One key challenge with this problem is that the probability of interest is normally extremely small. I'll discuss a new, provably efficient method to solve this problem for a general polytope and general Gaussian distribution. Moreover, in practice, the algorithm seems to substantially outperform our theoretical guarantees and we conjecture that our analysis is not tight. Proving the desired efficiency relies on a careful analysis of (highly) correlated functions of a Gaussian random vector.Joint work with Ton Dieker.

Some combinatorial enumeration problems: results and techniques

Series
Research Horizons Seminar
Time
Wednesday, November 14, 2018 - 12:20 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Prasad TetaliGeorgia Tech
There has been much interest in the past couple of decades in identifying (extremal) regular graphs that maximize the number of independent sets, matchings, colorings etc. There have been many advances using techniques such as the fractional subaddtivity of entropy (a.k.a. Shearer's inequality), the occupancy method etc. I will review some of these and mention some open problems on hypergraphs.

Scaling down the laws of thermodynamics

Series
Other Talks
Time
Wednesday, November 14, 2018 - 04:00 for 1 hour (actually 50 minutes)
Location
Molecular Science and Engineering Building, Classroom G011
Speaker
Christopher JarzynskiDirector, Institute for Physical Science and Technology University of Maryland
Thermodynamics provides a robust conceptual framework and set of laws that govern the exchange of energy and matter. Although these laws were originally articulated for macroscopic objects, it is hard to deny that nanoscale systems, as well, often exhibit “thermodynamic-like” behavior. To what extent can the venerable laws of thermodynamics be scaled down to apply to individual microscopic systems, and what new features emerge at the nanoscale? I will review recent progress toward answering these questions, with a focus on the second law of thermodynamics. I will argue that the inequalities ordinarily used to express the second law can be replaced by stronger equalities, known as fluctuation relations, which relate equilibrium properties to far-from-equilibrium fluctuations. The discovery and experimental validation of these relations has stimulated interest in the feedback control of small systems, the closely related Maxwell demon paradox, and the interpretation of the thermodynamic arrow of time. These developments have led to new tools for the analysis of non-equilibrium experiments and simulations, and they have refined our understanding of irreversibility and the second law. Bio Chris Jarzynski received an AB degree in physics from Princeton University in 1987, and a PhD in physics from the University of California, Berkeley in 1994. After postdoctoral positions at the University of Washington in Seattle and at Los Alamos National Laboratory in New Mexico, he became a staff member in the Theoretical Division at Los Alamos. In 2006, he moved to the University of Maryland, College Park, where he is now a Distinguished University Professor in the Department of Chemistry and Biochemistry, with joint appointments in the Institute for Physical Science and Technology and the Department of Physics. His research is primarily in the area of nonequilibrium statistical physics, where he has contributed to an understanding of how the laws of thermodynamics apply to nanoscale systems. He has been the recipient of a Fulbright Fellowship, the 2005 Sackler Prize in the Physical Sciences, and the 2019 Lars Onsager Prize in Theoretical Statistical Physics. He is a Fellow of the American Physical Society and the American Academy of Arts and Sciences. Contact: Professor Jennifer Curtis Email: jennifer.curtis@physics.gatech.edu

Obstacle problems for fully nonlinear PDEs

Series
PDE Seminar
Time
Tuesday, November 13, 2018 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Prof. Shigeaki KoikeTohoku University, Japan
We discuss bilateral obstacle problems for fully nonlinear second order uniformly elliptic partial differential equations (PDE for short) with merely continuous obstacles. Obstacle problems arise not only in minimization of energy functionals under restriction by obstacles but also stopping time problems in stochastic optimal control theory. When the main PDE part is of divergence type, huge amount of works have been done. However, less is known when it is of non-divergence type. Recently, Duque showed that the Holder continuity of viscosity solutions of bilateral obstacle problems, whose PDE part is of non-divergence type, and obstacles are supposed to be Holder continuous. Our purpose is to extend his result to enable us to apply a much wider class of PDE. This is a joint work with Shota Tateyama (Tohoku University).

Affine Grassmannians in motivic homotopy theory

Series
Geometry Topology Seminar
Time
Monday, November 12, 2018 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Tom BachmannMIT
It is a classical theorem in algebraic topology that the loop space of a suitable Lie group can be modeled by an infinite dimensional variety, called the loop Grassmannian. It is also well known that there is an algebraic analog of loop Grassmannians, known as the affine Grassmannian of an algebraic groop (this is an ind-variety). I will explain how in motivic homotopy theory, the topological result has the "expected" analog: the Gm-loop space of a suitable algebraic group is A^1-equivalent to the affine Grassmannian.

Capture small-noise-induced rare events in differential equations: from variation to sampling

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 12, 2018 - 13:55 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Prof. Xiaoliang WanLouisiana State University
In this talk, we will discuss some computational issues when applying the large deviation theory to study small-noise-induced rare events in differential equations. We focus on two specific problems: the most probable transition path for an ordinary differential equation and the asymptotically efficient simulation of rare events for an elliptic problem. Both problems are related to the large deviation theory. From a computational point of view, the former one is a variational problem while the latter one is a sampling problem. For the first problem, we have developed an hp adaptive minimum action method, and for the second problem, we will present an importance sampling estimator subject to a sufficient and necessary condition for its asymptotic efficiency.

Models of unstable motivic homotopy theory

Series
Geometry Topology Seminar Pre-talk
Time
Monday, November 12, 2018 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Tom BachmannMIT
I will review various ways of modeling the homotopy theory of spaces: several model categories of simplicial sheaves and simplicial presheaves, and related infinity categorical constructions.

A formula with some applications to the theory of Lyapunov exponents (Cancelled)

Series
Dynamical Systems Working Seminar
Time
Friday, November 9, 2018 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 156
Speaker
Rui HanGeorgia Tech
We prove an elementary formula about the average expansion of certain products of 2 by 2 matrices. This permits us to quickly re-obtain an inequality by M. Herman and a theorem by Dedieu and Shub, both concerning Lyapunov exponents. This is a work of A. Avila and J. Bochi. https://link.springer.com/article/10.1007/BF02785853

Locally decodable codes and arithmetic progressions in random settings

Series
Combinatorics Seminar
Time
Friday, November 9, 2018 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Sivakanth GopiMicrosoft Research Redmond
(1) A set D of natural numbers is called t-intersective if every positive upper density subset A of natural numbers contains a (t+1)-length arithmetic progression (AP) whose common differences is in D. Szemeredi's theorem states that the set of all natural numbers is t-intersective for every t. But there are other non-trivial examples like {p-1: p prime}, {1^k,2^k,3^k,\dots} for any k etc. which are t-intersective for every t. A natural question to study is at what density random subsets of natural numbers become t-intersective? (2) Let X_t be the number of t-APs in a random subset of Z/NZ where each element is selected with probability p independently. Can we prove precise estimates on the probability that X_t is much larger than its expectation? (3) Locally decodable codes (LDCs) are error correcting codes which allow ultra fast decoding of any message bit from a corrupted encoding of the message. What is the smallest encoding length of such codes? These seemingly unrelated problems can be addressed by studying the Gaussian width of images of low degree polynomial mappings, which seems to be a fundamental tool applicable to many such problems. Adapting ideas from existing LDC lower bounds, we can prove a general bound on Gaussian width of such sets which reproves the known LDC lower bounds and also implies new bounds for the above mentioned problems. Our bounds are still far from conjectured bounds which suggests that there is plenty of room for improvement. If time permits, we will discuss connections to type constants of injective tensor products of Banach spaces (or chernoff bounds for tensors in simpler terms). Joint work with Jop Briet.

Pages