Seminars and Colloquia by Series

Universal Behavior in nonlinear systems (an Introduction)

Series
Dynamical Systems Working Seminar
Time
Friday, March 2, 2018 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 271
Speaker
Adrian P. BustamanteGeorgia Tech
Given a one-parameter family of maps of an interval to itself, one can observe period doubling bifurcations as the parameter is varied. The aspects of those bifurcations which are independent of the choice of a particular one-parameter family are called universal. In this talk we will introduce, heuristically, the so-called Feigenbaun universality and then we'll expose some rigorous results about it.

Is space time? A spatiotemporal theory of turbulence

Series
Math Physics Seminar
Time
Friday, March 2, 2018 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 202
Speaker
Predrag CvitanovicSchool of Physics, Georgia Tech
Recent advances in fluid dynamics reveal that the recurrent flows observed in moderate Reynolds number turbulence result from close passes to unstable invariant solutions of Navier-Stokes equations. By now hundreds of such solutions been computed for a variety of flow geometries, but always confined to small computational domains (minimal cells).Pipe, channel and plane flows, however, are flows on infinite spatial domains. We propose to recast the Navier-Stokes equations as a space-time theory, with the unstable invariant solutions now being the space-time tori (and not the 1-dimensional periodic orbits of the classical periodic orbit theory). The symbolic dynamics is likewise higher-dimensional (rather than a single temporal string of symbols). In this theory there is no time, there is only a repertoire of admissible spatiotemporal patterns.We illustrate the strategy by solving a very simple classical field theory on a lattice modelling many-particle quantum chaos, adiscretized screened Poisson equation, or the ``spatiotemporal cat.'' No actual cats, graduate or undergraduate, have showninterest in, or were harmed during this research.

The Alexander module and categorification

Series
Geometry Topology Working Seminar
Time
Friday, March 2, 2018 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jen HomGeorgia Tech
In this series of talks, we will study the relationship between the Alexander module and the bordered Floer homology of the Seifert surface complement. In particular, we will show that bordered Floer categorifies Donaldson's TQFT description of the Alexander module. No prior knowledge of the Alexander module or Heegaard Floer homology will be assumed.

Non-smooth boundary value problems

Series
School of Mathematics Colloquium
Time
Friday, March 2, 2018 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jill PipherBrown University
The regularity properties of solutions to linear partial differential equations in domains depend on the structure of the equation, the degree of smoothness of the coefficients of the equation, and of the boundary of the domain. Quantifying this dependence is a classical problem, and modern techniques can answer some of these questions with remarkable precision. For both physical and theoretical reasons, it is important to consider partial differential equations with non-smooth coefficients. We’ll discuss how some classical tools in harmonic and complex analysis have played a central role in answering questions in this subject at the interface of harmonic analysis and PDE.

Matroids and log-concavity

Series
Student Algebraic Geometry Seminar
Time
Friday, March 2, 2018 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 254
Speaker
Marcel CelayaGeorgia Tech
In this talk we will discuss the paper of Adiprasito, Huh, and Katz titled "Hodge Theory for Combinatorial Geometries," which establishes the log-concavity of the characteristic polynomial of a matroid.

Cryptography: From ancient times to a post-quantum age

Series
Stelson Lecture Series
Time
Thursday, March 1, 2018 - 18:00 for 1 hour (actually 50 minutes)
Location
Klaus Lecture Auditorium 1443
Speaker
Jill PipherBrown University
How is it possible to send encrypted information across an insecure channel (like the internet) so that only the intended recipient can decode it, without sharing the secret key in advance? In 1976, well before this question arose, a new mathematical theory of encryption (public-key cryptography) was invented by Diffie and Hellman, which made digital commerce and finance possible. The technology advances of the last twenty years bring new and urgent problems, including the need to compute on encrypted data in the cloud and to have cryptography that can withstand the speed-ups of quantum computers. In this lecture, we will discuss some of the history of cryptography, as well as some of the latest ideas in "lattice" cryptography which appear to be quantum resistant and efficient.

Classification of knots in 3-sphere

Series
Geometry Topology Student Seminar
Time
Wednesday, February 28, 2018 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Hyun Ki MinGaTech
I will introduce the notion of satellite knots and show that a knot in a 3-sphere is either a torus knot, a satellite knot or a hyperbolic knot.

A sharp Schroedinger maximal estimate in two dimensions

Series
Analysis Seminar
Time
Wednesday, February 28, 2018 - 13:55 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Xiumin DuInstitute for Advanced Study
Joint with Guth and Li, recently we showed that the solution to the free Schroedinger equation converges to its initial data almost everywhere, provided that the initial data is in the Sobolev space H^s(R^2) with s>1/3. This is sharp up to the endpoint, due to a counterexample by Bourgain. This pointwise convergence problem can be approached by estimates of Schroedinger maximal functions, which have some similar flavor as the Fourier restriction estimates. In this talk, I'll first show how to reduce the original problem in three dimensions to an essentially two dimensional one, via polynomial partitioning method. Then we'll see that the reduced problem asks how to control the size of the solution on a sparse and spread-out set, and it can be solved by refined Strichartz estimates derived from l^2 decoupling theorem and induction on scales.

Pages