Seminars and Colloquia by Series

Building Databases of the Global Dynamics of Multiparameter Systems

Series
CDSNS Colloquium
Time
Monday, April 13, 2009 - 16:30 for 2 hours
Location
Skiles 255
Speaker
Konstantin MischaikowRutgers University
I will discuss new computational tools based on topological methods that extracts coarse, but rigorous, combinatorial descriptions of global dynamics of multiparameter nonlinear systems. These techniques are motivated by the fact that these systems can produce an wide variety of complicated dynamics that vary dramatically as a function of changes in the nonlinearities and the following associated challenges which we claim can, at least in part, be addressed. 1. In many applications there are models for the dynamics, but specific parameters are unknown or not directly computable. To identify the parameters one needs to be able to match dynamics produced by the model against that which is observed experimentally. 2. Experimental measurements are often too crude to identify classical dynamical structures such as fixed points or periodic orbits, let alone more the complicated structures associated with chaotic dynamics. 3. Often the models themselves are based on nonlinearities that a chosen because of heuristic arguments or because they are easy to fit to data, as opposed to being derived from first principles. Thus, one wants to be able to separate the scientific conclusions from the particular nonlinearities of the equations. To make the above mentioned comments concrete I will describe the techniques in the context of a simple model arising in population biology.

On the sum-product problem

Series
Other Talks
Time
Monday, April 13, 2009 - 16:30 for 2 hours
Location
Skiles 269
Speaker
Jozsef SolymosiMath, UBC
An old conjecture of Erdos and Szemeredi states that if A is a finite set of integers then the sum-set or the product-set should be large. The sum-set of A is A + A={a+b | a,b \in A\}, and the product set is defined in a similar way, A*A={ab | a,b \in A}. Erdos and Szemeredi conjectured that the sum-set or the product set is almost quadratic in |A|, i.e. max(|A+A|,|A*A|)> c|A|^{2-\epsilon}. In this talk we review some recent developments and problems related to the conjecture.

The Sutured Embedded Contact Homology of S^1\times D^2

Series
Geometry Topology Seminar
Time
Monday, April 13, 2009 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 269
Speaker
Roman GolovkoUSC
We will define the sutured version of embedded contact homology for sutured contact 3-manifolds. After that, we will show that the sutured version of embedded contact homology of S^1\times D^2, equipped with 2n sutures of integral or infinite slope on the boundary, coincides with the sutured Floer homology.

Universality Limits for Random Matrices and de Branges Spaces of Entire Functions

Series
Analysis Seminar
Time
Monday, April 13, 2009 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 255
Speaker
Doron LubinskySchool of Mathematics, Georgia Tech
It turns out that the sinc kernel is not the only kernel that arises as a universality limit coming from random matrices associated with measures with compact support. Any reproducing kernel for a de Branges space that is equivalent to a Paley-Winer space may arise. We discuss this and some other results involving de Branges spaces, universality, and orthogonal polynomials.

Hypergeometric functions - the GKZ-perspective

Series
Geometry Topology Seminar
Time
Monday, April 13, 2009 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 269
Speaker
Uli WaltherPurdue University
Starting with some classical hypergeometric functions, we explain how to derive their classical univariate differential equations. A severe change of coordinates transforms this ODE into a system of PDE's that has nice geometric aspects. This type of system, called A-hypergeometric, was introduced by Gelfand, Graev, Kapranov and Zelevinsky in about 1985. We explain some basic questions regarding these systems. These are addressed through homology, combinatorics, and toric geometry.

Numerical Methods for Total Variation and Besov Smoothing

Series
Applied and Computational Mathematics Seminar
Time
Monday, April 13, 2009 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 255
Speaker
Stacey LevineDuquesne University
We present new finite difference approximations for solving variational problems using the TV and Besov smoothness penalty functionals. The first approach reduces oversmoothing and anisotropy found in common discrete approximations of the TV functional. The second approach reduces the staircasing effect that arises from TV type smoothing. The algorithms converge and can be sped up using a multiscale algorithm. Numerical examples demonstrate both the qualitative and quantitative behavior of the solutions.

Polynomial hierarchy, Betti numbers and a real analogue of Toda's theorem

Series
ACO Seminar
Time
Friday, April 10, 2009 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 255
Speaker
Saugata BasuSchool of Mathematics, Georgia Tech and Purdue University
Toda proved in 1989 that the (discrete) polynomial time hierarchy, {\bf PH}, is contained in the class {\bf P}^{#\bf P}, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #{\bf P}. This result which illustrates the power of counting is considered to be a seminal result in computational complexity theory. An analogous result in the complexity theory over the reals (in the sense of Blum-Shub-Smale real Turing machines) has been missing so far. We formulate and prove a real analogue of Toda's theorem. Unlike Toda's proof in the discrete case, which relied on sophisticated combinatorial arguments, our proof is topological in nature. (Joint work with Thierry Zell.)

The Jones polynomial and quantum invariants

Series
Geometry Topology Working Seminar
Time
Friday, April 10, 2009 - 15:00 for 2 hours
Location
Skiles 269
Speaker
Thang LeSchool of Mathematics, Georgia Tech

Please Note: These are two hour talks.

We will develop general theory of quantum invariants based on sl_2 (the simplest Lie algebra): The Jones polynomials, the colored Jones polynomials, quantum sl_2 groups, operator invariants of tangles, and relations with the Alexander polynomial and the A-polynomials. Optional: Finite type invariants and the Kontsevich integral.

Linear algebra method in combinatorics

Series
SIAM Student Seminar
Time
Friday, April 10, 2009 - 12:30 for 2 hours
Location
Skiles 269
Speaker
Tianjun YeSchool of Mathematics, Georgia Tech
Linear algebra method is a very useful method in combinatorics. Lovas Theorem (a very deep theorem about perfect graph) is proved by using this way. The idea is, if we want to come up with an upper bound on the size of a set of objects, associate them with elements in a vector space V of relatively low dimension, and show that these elements are linearly independent. Then we cannot have more objects in our set than the dimension of V. We will show we can use this way to solve some combinatorics problem, such as odd town problem and two-distance sets problem.

Cameron-Martin theorem for Complete Noncompact Riemannian Manifold

Series
Stochastics Seminar
Time
Thursday, April 9, 2009 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 269
Speaker
Elton HsuDepartment of Mathematics, Northwestern University
The Cameron-Martin theorem is one of the cornerstones of stochastic analysis. It asserts that the shifts of the Wiener measure along certain flows are equivalent. Driver and others have shown that this theorem, after an appropriate reformulation, can be extension to the Wiener measure on the path space over a compact Riemannian manifold. In this talk we will discuss this and other extensions of the Cameron-Martin theorem and show that it in fact holds for an arbitrary complete Riemannian manifold.

Pages