Seminars and Colloquia by Series

Friday, March 6, 2009 - 15:00 , Location: Skiles 268 , Alex Grigo , School of Mathematics, Georgia Tech , Organizer:
The talk is based on the paper titled "Anosov diffeomorphisms and coupling" by Bressaud and Liverani. Existence and uniqueness of SRB invariant measure for the dynamics is established via a coupling of initial conditions introduced to dynamics by L.-S. Young.
Friday, March 6, 2009 - 12:30 , Location: Skiles 269 , Kai Ni , School of Mathematics, Georgia Tech , Organizer:
In this talk, I will briefly introduce some basics of mathematical learning theory. Two basic methods named perceptron algorithm and support vector machine will be explained for the separable classification case. Also, the subgaussian random variable and Hoeffding inequality will be mentioned in order to provide the upper bound for the deviation of the empirical risk. If time permits, the Vapnik combinatorics will be involved for shaper bounds of this deviation.
Thursday, March 5, 2009 - 15:00 , Location: Skiles 269 , Yuanhui Xiao , Department of Mathematics and Statistics, Georgia State University , Organizer: Heinrich Matzinger
A shot noise process is essentially a compound Poisson process whereby the arriving shots are allowed to accumulate or decay after their arrival via some preset shot (impulse response) function. Shot noise models see applications in diverse areas such as insurance, fi- nance, hydrology, textile engineering, and electronics. This talk stud- ies several statistical inference issues for shot noise processes. Under mild conditions, ergodicity is proven in that process sample paths sat- isfy a strong law of large numbers and central limit theorem. These results have application in storage modeling. Shot function parameter estimation from a data history observed on a discrete-time lattice is then explored. Optimal estimating functions are tractable when the shot function satisfies a so-called interval similar condition. Moment methods of estimation are easily applicable if the shot function is com- pactly supported and show good performance. In all cases, asymptotic normality of the proposed estimators is established.
Thursday, March 5, 2009 - 11:00 , Location: Skiles 269 , Rick Kenyon , Mathematics Department, Brown University , Organizer: Guillermo Goldsztein
This is joint work with Andrei Okounkov. The ``honeycomb dimer model'' is a natural model of discrete random surfaces in R^3. It is possible to write down a ``Law of Large Numbers" for such surfaces which describes the typical shape of a random surface when the mesh size tends to zero. Surprisingly, one can parameterize these limit shapes in a very simple way using analytic functions, somewhat reminiscent of the Weierstrass parameterization of minimal surfaces. This is even more surprising since the limit shapes tend to be facetted, that is, only piecewise analytic. There is a large family of boundary conditions for which we can obtain exact solutions to the limit shape problem using algebraic geometry techniques. This family includes the (well-known) solution to the limit shape of a ``boxed plane partition'' and has many generalizations.
Wednesday, March 4, 2009 - 13:30 , Location: ISyE Executive Classroom , Shiva Kintali , CS, Georgia Tech , Organizer: Annette Rohrs
Scarf's lemma is one of the fundamental results in combinatorics, originally introduced to study the core of an N-person game. Over the last four decades, the usefulness of Scarf's lemma has been demonstrated in several important combinatorial problems seeking stable solutions. However, the complexity of the computational version of Scarf's lemma (Scarf) remained open. In this talk, I will prove that Scarf is complete for the complexity class PPAD. This shows that Scarf is as hard as the computational versions of Brouwer's fixed point theorem and Sperner's lemma. Hence, there is no polynomial-time algorithm for Scarf unless PPAD \subseteq P. I will also talk about fractional stable paths problem, finding fractional kernels in digraphs, finding fractional stable matching in hypergraphic preference systems and finding core in an N-person balanced game with non-transferable utilities. I will show the connection between these problems through Scarf's lemma and address the complexity of these problems.
Wednesday, March 4, 2009 - 11:00 , Location: Skiles 255 , Sean Ellermeyer , Kennesaw State University , Organizer:
We consider a class of age-structured population models in which the central modeling assumption is simply that the birth rate depends on the size of the adult population. For the most part, we in fact assume that the birth rate is a monotone non-decreasing function of the adult population size. Despite the simplicity of our modeling assumptions (or perhaps because of it), we will see that this class of models admits a wide variety of solutions (exponentially growing, lineary growing, periodic, etc.) Much of the analysis of these models can be carried out using elementary techniques and we present some specific examples in which explicit solutions (which are elementary functions) can be generated. We also consider some questions related to the inverse problem for these models.
Series: PDE Seminar
Tuesday, March 3, 2009 - 15:05 , Location: Skiles 255 , Marianne Korten , Kansas State University, Manhattan , Organizer:
In this talk I will describe recent work with C. N. Moore about the two-phase Stefan problem with a degenerate zone. We start with local solutions (no reference to initial or boundary data) and then obtain intrinsic energy estimates, that will in turn lead to the continuity of the temperature. We then show existence and uniqueness of solutions with signed measures as data. The uniqueness problem with signed measure data has been open for some 30 years for any degenerate parabolic equation.
Monday, March 2, 2009 - 15:00 , Location: Skiles 269 , Uli Walther , Purdue University , Organizer: Stavros Garoufalidis
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.
Monday, March 2, 2009 - 13:00 , Location: Skiles 269 , Keiko Kawamuro , IAS , Organizer: John Etnyre
We introduce a construction of an immersed surface for a null-homologous braid in an annulus open book decomposition. This is hinted by the so called Bennequin surface for a braid in R^3. By resolving the singularities of the immersed surface, we obtain an embedded Seifert surface for the braid. Then we compute a self-linking number formula using this embedded surface and observe that the Bennequin inequality is satisfied if and only the contact structure is tight. We also prove that our self-linking formula is invariant (changes by 2) under a positive (negative) braid stabilization which preserves (changes) the transverse knot class.
Friday, February 27, 2009 - 15:05 , Location: Skiles 269 , Igor Belegradek , Ga Tech , Organizer: John Etnyre
Comparison geometry studies Riemannian manifolds with a given curvature bound. This minicourse is an introduction to volume comparison (as developed by Bishop and Gromov), which is fundamental in understanding manifolds with a lower bound on Ricci curvature. Prerequisites are very modest: we only need basics of Riemannian geometry, and fluency with fundamental groups and metric spaces. In the third (2 hour) lecture I shall prove volume and Laplacian comparison theorems.