Seminars and Colloquia by Series

Parameterization of Invariant Manifolds for Lagrangian Systems with Long-range Interactions

Series
CDSNS Colloquium
Time
Monday, February 13, 2012 - 11:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Hector LomeliUniv. of Texas at Austin/ITAM
We generalize some notions that have played an important role in dynamics, namely invariant manifolds, to the more general context of difference equations. In particular, we study Lagrangian systems in discrete time. We define invariant manifolds, even if the corresponding difference equations can not be transformed in a dynamical system. The results apply to several examples in the Physics literature: the Frenkel-Kontorova model with long-range interactions and the Heisenberg model of spin chains with a perturbation. We use a modification of the parametrization method to show the existence of Lagrangian stable manifolds. This method also leads to efficient algorithms that we present with their implementations. (Joint work with Rafael de la Llave.)

Discrete Mathematical Biology Working Seminar

Series
Other Talks
Time
Monday, February 13, 2012 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 114
Speaker
Svetlana PoznanovikGeorgia Tech
A discussion of the paper "Linear trees and RNA secondary structure" by Schmitt and Waterman (1994) and, as time permits, "Combinatorics of RNA secondary structures" by Hofacker, Schuster, and Stadler (1998).

Oral Comprehensive Exam: Low rank estimation of similarities on graphs

Series
Other Talks
Time
Monday, February 13, 2012 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 170
Speaker
Pedro RangelSchool of Mathematics, Georgia Tech
The goal in matrix recovery problems is to estimate an unknown rank-r matrix S of size m based on a set of n observations. It is easy to see that even in the case where the observations are not contaminated with noise, there exist low rank matrices that cannot be recovered based on n observations unless n is very large. In order to deal with these cases, Candes and Tao introduced the called low-coherence assumptions and a parameter \nu measuring how low-coherent the objective matrix S is. Using the low-coherence assumptions, Gross proved that S can be recovered with high probability if n>O(\nu r m \log^2(m)) by an estimator based on nuclear norm penalization. Let's consider the generalization of the matrix recovery problem where the matrix S is not only low-rank but also "smooth" with respect to the geometry given by a graph G. In this 40 minutes long talk, the speaker will present an approximation error bound for a proposed estimator in this generalization of the matrix recovery problem.

An Overview of Lattice Cryptography

Series
ACO Student Seminar
Time
Friday, February 10, 2012 - 13:00 for 1 hour (actually 50 minutes)
Location
TBD
Speaker
Christopher PeikertSchool of Computer Science
I'll give a high-level tour of how lattices are providing a powerful new mathematical foundation for cryptography. Lattices provide simple, fast, and highly parallel cryptoschemes that, in contrast with many of today's popular methods (like RSA and elliptic curves), even appear to remain secure against quantum computers. No background in lattices, cryptography, or quantum computers will be necessary -- you only need to know how to add and multiply vectors and matrices.

Log-Sobolev inequalities for subelliptic operators satisfying a generalized curvature dimension inequality

Series
Stochastics Seminar
Time
Thursday, February 9, 2012 - 15:05 for 1 hour (actually 50 minutes)
Location
Skyles 006
Speaker
Fabrice BaudoinUniversity of Purdue
Let $\M$ be a smooth connected manifold endowed with a smooth measure $\mu$ and a smooth locally subelliptic diffusion operator $L$ which is symmetric with respect to $\mu$. We assume that $L$ satisfies a generalized curvature dimension inequality as introduced by Baudoin-Garofalo \cite{BG1}. Our goal is to discuss functional inequalities for $\mu$ like the Poincar\'e inequality, the log-Sobolev inequality or the Gaussian logarithmic isoperimetric inequality.

Gel'fand Duality

Series
Geometry Topology Student Seminar
Time
Wednesday, February 8, 2012 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 169
Speaker
Jonathan PaprockiGeorgia Tech
We will prove a duality between locally compact Hausdorff spaces and the C*-algebra of continuous complex-valued functions on that space. Formally, this is the equivalence of the opposite category of commutative C*-algebras and the category of locally compact Hausdorff spaces.

Geometric flow for biomolecular solvation

Series
Mathematical Biology Seminar
Time
Wednesday, February 8, 2012 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Nathan BakerPacific Northwest National Laboratory
Implicit solvent models are important components of modern biomolecular simulation methodology due to their efficiency and dramatic reduction of dimensionality. However, such models are often constructed in an ad hoc manner with an arbitrary decomposition and specification of the polar and nonpolar components. In this talk, I will review current implicit solvent models and suggest a new free energy functional which combines both polar and nonpolar solvation terms in a common self-consistent framework. Upon variation, this new free energy functional yields the traditional Poisson-Boltzmann equation as well as a new geometric flow equation. These equations are being used to calculate the solvation energies of small polar molecules to assess the performance of this new methodology. Optimization of this solvation model has revealed strong correlation between pressure and surface tension contributions to the nonpolar solvation contributions and suggests new ways in which to parameterize these models. **Please note nonstandard time and room.**

Train tracks and entropy

Series
Research Horizons Seminar
Time
Wednesday, February 8, 2012 - 12:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Dan MargalitGeorgia Tech
To any self-map of a surface we can associate a real number, called the entropy. This number measures, among other things, the amount of mixing being effected on the surface. As one example, you can think about a taffy pulling machine, and ask how efficiently the machine is stretching the taffy. Using Thurston's notion of a train track, it is actually possible to compute these entropies, and in fact, this is quite easy in practice. We will start from the basic definitions and proceed to give an overview of Thurston's theory. This talk will be accessible to graduate students and advanced undergraduates.

CANCELLED!

Series
School of Mathematics Colloquium
Time
Wednesday, February 8, 2012 - 11:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Jeff KahnMathematics, Rutgers University
Pardon the inconvenience. We plan to reschedule later...

Pages