Seminars and Colloquia by Series

$L^p$ restriction of eigenfunctions to random Cantor-type sets

Series
Analysis Seminar
Time
Wednesday, September 26, 2018 - 13:55 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Suresh EswarathasanCardiff University
Abstract: Let $(M,g)$ be a compact Riemannian n-manifold without boundary. Consider the corresponding $L^2$-normalized Laplace-Beltrami eigenfunctions. Eigenfunctions of this type arise in physics as modes of periodic vibration of drums and membranes. They also represent stationary states of a free quantum particle on a Riemannian manifold. In the first part of the lecture, I will give a survey of results which demonstrate how the geometry of $M$ affects the behaviour of these special functions, particularly their “size” which can be quantified by estimating $L^p$ norms. In joint work with Malabika Pramanik (U. British Columbia), I will present in the second part of my lecture a result on the $L^p$ restriction of these eigenfunctions to random Cantor-type subsets of $M$. This, in some sense, is complementary to the smooth submanifold $L^p$ restriction results of Burq-Gérard-Tzetkov ’06 (and later work of other authors). Our method includes concentration inequalities from probability theory in addition to the analysis of singular Fourier integral operators on fractals.

On the Log-Brunn-Minkowski inequality

Series
High Dimensional Seminar
Time
Wednesday, September 26, 2018 - 12:55 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Galyna LivshytsGeorgia Institute of technology

I shall tell about some background and known results in regards to the celebrated and fascinating Log-Brunn-Minkowski inequality, setting the stage for Xingyu to discuss connections with elliptiic operators a week later.

What is a formula?

Series
Research Horizons Seminar
Time
Wednesday, September 26, 2018 - 12:20 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Igor PakUniversity of California, Los Angeles
Integer sequences arise in a large variety of combinatorial problems as a way to count combinatorial objects. Some of them have nice formulas, some have elegant recurrences, and some have nothing interesting about them at all. Can we characterize when? Can we even formalize what is a "formula"? I will try to answer these questions by presenting many examples, results and open problems. Note: This is an introductory general audience talk unrelated to the colloquium.

Shapes of local minimizers for a model of capillary energy in periodic media

Series
PDE Seminar
Time
Tuesday, September 25, 2018 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
William FeldmanUniversity of Chicago
I will discuss the limit shapes for local minimizers of the Alt-Caffarelli energy. Fine properties of the associated pinning intervals, continuity/discontinuity in the normal direction, determine the formation of facets in an associated quasi-static motion. The talk is partially based on joint work with Charles Smart.

Link Concordance and Groups

Series
Geometry Topology Seminar
Time
Monday, September 24, 2018 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Miriam KuzbaryRice University
Since its introduction in 1966 by Fox and Milnor the knot concordance group has been an invaluable algebraic tool for examining the relationships between 3- and 4- dimensional spaces. Though knots generalize naturally to links, this group does not generalize in a natural way to a link concordance group. In this talk, I will present joint work with Matthew Hedden where we define a link concordance group based on the “knotification” construction of Peter Ozsvath and Zoltan Szabo. This group is compatible with Heegaard Floer theory and, in fact, much of the work on Heegaard Floer theory for links has implied a study of these objects. Moreover, we have constructed a generalization of Milnor’s group-theoretic higher order linking numbers in a novel context with implications for our link concordance group.

Accelerated Optimization in the PDE Framework

Series
Applied and Computational Mathematics Seminar
Time
Monday, September 24, 2018 - 13:55 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Anthony YezziGeorgia Tech, ECE
Following the seminal work of Nesterov, accelerated optimization methods (sometimes referred to as momentum methods) have been used to powerfully boost the performance of first-order, gradient-based parameter estimation in scenarios were second-order optimization strategies are either inapplicable or impractical. Not only does accelerated gradient descent converge considerably faster than traditional gradient descent, but it performs a more robust local search of the parameter space by initially overshooting and then oscillating back as it settles into a final configuration, thereby selecting only local minimizers with an attraction basin large enough to accommodate the initial overshoot. This behavior has made accelerated search methods particularly popular within the machine learning community where stochastic variants have been proposed as well. So far, however, accelerated optimization methods have been applied to searches over finite parameter spaces. We show how a variational setting for these finite dimensional methods (recently formulated by Wibisono, Wilson, and Jordan) can be extended to the infinite dimensional setting, both in linear functional spaces as well as to the more complicated manifold of 2D curves and 3D surfaces.

Higher Order Linking Numbers

Series
Geometry Topology Seminar Pre-talk
Time
Monday, September 24, 2018 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Miriam KuzbaryRice University
In this introductory talk I will outline the general landscape of Milnor’s invariants for links. First introduced in Milnor’s master’s thesis in 1954, these invariants capture fundamental information about links and have remained a fascinating object of study throughout the past half century. In the early 80s, Turaev and Porter independently proved their long-conjectured correspondence with Massey products of the link complement and in 1990, Tim Cochran introduced a beautiful construction to compute them using intersection theory. I will give an overview of these constructions and motivate the importance of these invariants, particularly for the study of links considered up to concordance.

Gradient-like dynamics: motion near a manifold of quasi-equilibria

Series
CDSNS Colloquium
Time
Monday, September 24, 2018 - 11:15 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Peter BatesMichigan State University
This concerns general gradient-like dynamical systems in Banach space with the property that there is a manifold along which solutions move slowly compared to attraction in the transverse direction. Conditions are given on the energy (or, more generally, Lyapunov functional) that ensure solutions starting near the manifold stay near for a long time or even forever. Applications are given with the vector Allen-Cahn and Cahn-Morral equations. This is joint work with Giorgio Fusco and Georgia Karali.

A simple proof of a generalization of a Theorem by C.L. Siegel

Series
Dynamical Systems Working Seminar
Time
Friday, September 21, 2018 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 156
Speaker
Adrian P. BustamanteGeorgia Tech
In this talk I will present a proof of a generalization of a theorem by Siegel, about the existence of an analytic conjugation between an analytic map, $f(z)=\Lambda z +\hat{f}(z)$, and a linear map, $\Lambda z$, in $\mathbb{C}^n$. This proof illustrates a standar technique used to deal with small divisors problems. I will be following the work of E. Zehnder.

Hamiltonicity in randomly perturbed hypergraphs.

Series
Combinatorics Seminar
Time
Friday, September 21, 2018 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Yi ZhaoGeorgia State University
For integers k>2 and \ell0, there exist \epsilon>0 and C>0 such that for sufficiently large n that is divisible by k-\ell, the union of a k-uniform hypergraph with minimum vertex degree \alpha n^{k-1} and a binomial random k-uniform hypergraph G^{k}(n,p) on the same n-vertex set with p\ge n^{-(k-\ell)-\epsilon} for \ell\ge 2 and p\ge C n^{-(k-1)} for \ell=1 contains a Hamiltonian \ell-cycle with high probability. Our result is best possible up to the values of \epsilon and C and completely answers a question of Krivelevich, Kwan and Sudakov. This is a joint work with Jie Han.

Pages