Seminars and Colloquia by Series

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.

Theory in Practice: a case study

Series
Research Horizons Seminar
Time
Wednesday, September 19, 2018 - 12:20 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Blair SullivanNorth Carolina State University
In this talk, we describe transforming a theoretical algorithm from structural graph theory into open-source software being actively used for real-world data analysis in computational biology. Specifically, we apply the r-dominating set algorithm for graph classes of bounded expansion in the setting of metagenome analysis. We discuss algorithmic improvements required for a practical implementation, alongside exciting preliminary biological results (on real data!). Finally, we include a brief retrospective on the collaboration process. No prior knowledge in metagenomics or structural graph theory is assumed. Based on joint work with T. Brown, D. Moritz, M. O’Brien, F. Reidl and T. Reiter.

Random growth models

Series
Research Horizons Seminar
Time
Wednesday, September 12, 2018 - 12:20 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Michael DamronGeorgia Tech
Random and irregular growth is all around us. We see it in the form of cancer growth, bacterial infection, fluid flow through porous rock, and propagating flame fronts. In this talk, I will introduce several different models for random growth and the different shapes that can arise from them. Then I will talk in more detail about one model, first-passage percolation, and some of the main questions that researchers study about it.

What is Weak KAM Theory?

Series
Research Horizons Seminar
Time
Wednesday, April 11, 2018 - 12:10 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Albert FathiGeorgia Tech
The goal of this lecture is to explain and motivate the connection between Aubry-Mather theory (Dynamical Systems), and viscosity solutions of the Hamilton-Jacobi equation (PDE).This connection is the content of weak KAM Theory.The talk should be accessible to the “generic” mathematician. No a priori knowledge of any of the two subjects is assumed.The set-up of this theory is classical mechanical systems, in its Lagrangian formulation to take advantage of the action principle. This is the natural setting for Celestial Mechanics. Today it is also the setting for motions of satellites in the solar system.Hamilton found a reformulation of Lagrangian mechanics in terms of position and momentum instead of position and speed. In this formulation appears the Hamilton-Jacobi equation. Although this is a partial differential equation, its solutions allow to find solutions of the Hamiltonian (or Lagrangian) systems which are, in fact, governed by an ordinary differential equation.KAM (Kolmogorov-Arnold-Moser) theorem addressed at its beginning (Kolomogorov) the problem of stability of the solar system. It came as a surprise, since Poincare ́’s earlier work pointed to instability. In fact, some initial conditions lead to instability (Poincare ́) and some others lead to stability(Kolomogorov).Aubry-Mather theory finds some more substantial stable motion that survives outside the region where KAM theorem applies.The KAM theorem also provides global differentiable solutions to the Hamilton-Jacobi equation.It is known that the Hamilton-Jacobi equation usually does not have smooth global solutions. Lions & Crandall developed a theory of weak solutions of the Hamilton-Jacobi equation.Weak KAM theory explains how the Aubry-Mather sets can be obtained from the points where weak solutions of the Hamilton-Jacobi equation are differentiable.

Multiscale methods for high-dimensional data with low-dimensional structures

Series
Research Horizons Seminar
Time
Wednesday, March 28, 2018 - 12:10 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Wenjing LiaoGeorgia Tech
Many data sets in image analysis and signal processing are in a high-dimensional space but exhibit a low-dimensional structure. We are interested in building efficient representations of these data for the purpose of compression and inference. In the setting where a data set in $R^D$ consists of samples from a probability measure concentrated on or near an unknown $d$-dimensional manifold with $d$ much smaller than $D$, we consider two sets of problems: low-dimensional geometric approximations to the manifold and regression of a function on the manifold. In the first case, we construct multiscale low-dimensional empirical approximations to the manifold and give finite-sample performance guarantees. In the second case, we exploit these empirical geometric approximations of the manifold and construct multiscale approximations to the function. We prove finite-sample guarantees showing that we attain the same learning rates as if the function was defined on a Euclidean domain of dimension $d$. In both cases our approximations can adapt to the regularity of the manifold or the function even when this varies at different scales or locations.

Essential skills for Math grads, according to Math grads: finding money, learning MathSciNet, downloading articles, and making posters.

Series
Research Horizons Seminar
Time
Wednesday, March 14, 2018 - 12:10 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Elizabeth HoldsworthGeorgia Tech
There is so much that the GT library can do for you, from providing research materials to assistance with data visualization to patent guidance. However, rather than trying to guess what you want from us, this year we asked! Based on the response to a short ranking survey I sent out last month, this session will cover: 1. How to find grants, fellowships, and travel money with the sponsorship database, Pivot. There are opportunities for postdocs and non US citizens too!2. How to use MathSciNet. We will cover navigating its classification index to actually getting the article you want. 3. How to find and download articles from our systems, Google Scholar, and from other libraries. And if we have time: 4. How to make a poster and cheaply print it.

Crash course in Ergodic Theory

Series
Research Horizons Seminar
Time
Wednesday, February 14, 2018 - 12:10 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Leonid BunimovichGeorgia Tech
Some basic problems, notions and results of the Ergodic theory will be introduced. Several examples will be discussed. It is also a preparatory talk for the next day colloquium where finite time properties of dynamical and stochastic systems will be discussed rather than traditional questions all dealing with asymptotic in time properties.

Crash Course in Ergodic Theory

Series
Research Horizons Seminar
Time
Friday, February 2, 2018 - 15:53 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Leonid BunimovichGA Tech
Some basic problems, notions and results of the Ergodic theory will be introduced. Several examples will be discussed. It is also a preparatory talk for the next day colloquium where finite time properties of dynamical and stochastic systems will be discussed rather than traditional questions all dealing with asymptotic in time properties.

Typical and Generic Ranks in Low Rank Matrix Completion

Series
Research Horizons Seminar
Time
Wednesday, January 31, 2018 - 12:10 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Greg BlekhermanGA Tech
In recent years the problem of low-rank matrix completion received a tremendous amount of attention. I will consider the problem of exact low-rank matrix completion for generic data. Concretely, we start with a partially-filled matrix M, with real or complex entries, with the goal of finding the unspecified entries (completing M) in such a way that the completed matrix has the lowest possible rank, called the completion rank of M. We will be interested in how this minimal completion rank depends on the known entries, while keeping the locations of specified and unspecified entries fixed. Generic data means that we only consider partial fillings of M where a small perturbation of the entries does not change the completion rank of M.

Topological Entropy, IDA-CCS, and Internship Opportunities

Series
Research Horizons Seminar
Time
Wednesday, December 6, 2017 - 13:10 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Kelly Yancey and Matthew YanceyInstitute for Defense Analyses
The Institute for Defense Analyses - Center for Computing Sciences is a nonprofit research center that works closely with the NSA. Our center has around 60 researchers (roughly 30 mathematicians and 30 computer scientists) that work on interesting and hard problems. The plan for the seminar is to begin with a short mathematics talk on a project that was completed at IDA-CCS and declassified, then tell you a little about what we do, and end with your questions. The math that we will discuss involves symbolic dynamics and automata theory. Specifically we will develop a metric on the space of regular languages using topological entropy. This work was completed during a summer SCAMP at IDA-CCS. SCAMP is a summer program where researchers from academia (professors and students), the national labs, and the intelligence community come to IDA-CCS to work on the agency's hard problems for 11 weeks.

Pages