Seminars and Colloquia by Series

Tuesday, January 26, 2010 - 11:05 , Location: Skiles 269 , Shamgar Gurevich , Institute for Advanced Study, Princeton , shamgar@ias.edu , Organizer: Christopher Heil
In the lecture I will explain how various fundamental structures from group representation theory appear naturally in the context of discrete harmonic analysis and can be applied to solve concrete problems from digital signal processing. I will begin the lecture by describing our solution to the problem of finding a canonical orthonormal basis of eigenfunctions of the discrete Fourier transform (DFT). Then I will explain how to generalize the construction to obtain a larger collection of functions that we call "The oscillator dictionary". Functions in the oscillator dictionary admit many interesting pseudo-random properties, in particular, I will explain several of these properties which arise in the context of problems of current interest in communication theory.
Thursday, January 21, 2010 - 15:00 , Location: Skiles 255 , Yekaterina Epshteyn , Carnegie Mellon University , Organizer: Sung Ha Kang
In this talk, I will first discuss several chemotaxis models includingthe classical Keller-Segel model.Chemotaxis is the phenomenon in which cells, bacteria, and other single-cell or multicellular organisms direct their movements according to certain chemicals (chemoattractants) in their environment. The mathematical models of chemotaxis are usually described by highly nonlinear time dependent systems of PDEs. Therefore, accurate and efficient numerical methods are very important for the validation and analysis of these systems. Furthermore, a common property of all existing chemotaxis systems is their ability to model a concentration phenomenon that mathematically results in solutions rapidly growing in small neighborhoods of concentration points/curves. The solutions may blow up or may exhibit a very singular, spiky behavior. In either case, capturing such solutions numerically is a challenging problem.  In our work we propose a family of stable (even at times near blow up) and highly accurate numerical methods, based on interior penalty discontinuous Galerkin schemes (IPDG) for the Keller-Segel chemotaxis model with parabolic-parabolic coupling. This model is the basic step in the modeling of many real biological processes and it is described by a system of a convection-diffusion equation for the cell density, coupled with a reaction-diffusion equation for the chemoattractant concentration.We prove theoretical hp error estimates for the proposed discontinuous Galerkin schemes. Our proof is valid for pre-blow-up times since we assume boundedness of the exact solution.Numerical experiments to demonstrate the stability and accuracy of the proposed methods for chemotaxis models and comparison with other methods will be presented. Ongoing research projects will be  discussed as well.
Tuesday, January 19, 2010 - 11:05 , Location: Skiles 269 , Pavlo Pylyavskyy , University of Michigan , Organizer: Prasad Tetali
The Edrei-Thoma theorem characterizes totally positive functions, and plays an important role in character theory of the infinite symmetric group. The Loewner-Whitney theorem characterizes totally positive elements of the general linear group, and is fundamental for Lusztig's theory of total positivity in reductive groups. In this work we derive a common generalization of the two theorems. The talk is based on joint work with Thomas Lam.
Thursday, January 7, 2010 - 14:00 , Location: Skiles 269 , Dan Margalit , Tufts University , Dan.Margalit@tufts.edu , Organizer: John Etnyre
Attached to every homeomorphism of a surface is a real number called its dilatation.  For a generic (i.e. pseudo-Anosov) homeomorphism, the dilatation is an algebraic integer that records various properties of the map.  For instance, it determines the entropy (dynamics), the growth rate of lengths of geodesics under iteration (geometry), the growth rate of intersection numbers under iteration (topology), and the length of the corresponding loop in moduli space (complex analysis). The set of possible dilatations is quite mysterious.  In this talk I will explain the discovery, joint with Benson Farb and Chris Leininger, of two universality phenomena.  The first can be described as "algebraic complexity implies dynamical complexity", and the second as "geometric complexity implies dynamical complexity".
Tuesday, December 8, 2009 - 14:00 , Location: Skiles 269 , Xia Hua , Massachusetts Institute of Technology , Organizer: Christian Houdre
In a regression model, say Y_i=f(X_i)+\epsilon_i, where (X_i,Y_i) are observed and f is an unknown regression function, the errors \epsilon_i may satisfy what we call the "weak'' assumption that they are orthogonal with mean 0 and the same variance, and often the further ``strong'' assumption that they are i.i.d. N(0,\sigma^2) for some \sigma\geq 0. In this talk, I will focus on the polynomial regression model, namely f(x) = \sum_{i=0}^n a_i x^i for unknown parameters a_i, under the strong assumption on the errors. When a_i's are estimated via least squares (equivalent to maximum likelihood) by \hat a_i, we then get the {\it residuals} \hat epsilon_j := Y_j-\sum_{i=0}^n\hat a_iX_j^i. We would like to test the hypothesis that the nth order polynomial regression holds with \epsilon_j i.i.d. N(0,\sigma^2) while the alternative can simply be the negation or be more specific, e.g., polynomial regression with order higher than n. I will talk about two possible tests, first the rather well known turning point test, and second a possibly new "convexity point test.'' Here the errors \epsilon_j are unobserved but for large enough n, if the model holds, \hat a_i will be close enough to the true a_i so that \hat epsilon_j will have approximately the properties of \epsilon_j. The turning point test would be applicable either by this approximation or in case one can evaluate the distribution of the turning point statistic for residuals. The "convexity point test'' for which the test statistic is actually the same whether applied to the errors \epsilon_j or the residuals \hat epsilon_j avoids the approximation required in applying the turning point test to residuals. On the other hand the null distribution of the convexity point statistic depends on the assumption of i.i.d. normal (not only continuously distributed) errors.
Monday, December 7, 2009 - 14:05 , Location: Skiles 255 , Robert Young , IHES/Courant , Organizer: Igor Belegradek
The Dehn function is a group invariant which connects geometric and combinatorial group theory; it measures both the difficulty of the word problem and the area necessary to fill a closed curve in an associated space with a disc.  The behavior of the Dehn function for high-rank lattices in high-rank symmetric spaces has long been an openquestion; one particularly interesting case is SL(n,Z).  Thurston conjectured that SL(n,Z) has a quadratic Dehn function when n>=4. This differs from the behavior for n=2 (when the Dehn function is linear) and for n=3 (when it is exponential).  I have proved Thurston's conjecture when n>=5, and in this talk, I will give an introduction to the Dehn function, discuss some of the background of the problem and, time permitting, give a sketch of the proof.
Thursday, February 12, 2009 - 11:00 , Location: Skiles 269 , Ritabrata Munshi , Rutgers University , Organizer: Jeff Geronimo
In late 1980's Manin et al put forward a precise conjecture about the density of rational points on Fano varieties. Over the last two decades some progress has been made towards proving this conjecture. But the conjecture is far from being proved even for the case of two dimensional Fano varieties or del Pezzo surfaces. These surfaces are geometrically classified according to `degree', and the geometric, as well as, the arithmetic complexity increases as the degree drops. The most interesting cases of Manin's conjecture for surfaces are degrees four and lower. In this talk I will mainly focus on the arithmetic of these del Pezzo surfaces, and report some of my own results (partly joint with Henryk Iwaniec). I will also talk about some other problems which apparently have a different flavor but, nonetheless, are directly related with the problem of rational points on surfaces.
Monday, February 2, 2009 - 15:00 , Location: Skiles 255 , Dapeng Zhan , Yale University , Organizer:
Stochastic Loewner evolution (SLE) introduced by Oded Schramm is a breakthrough in studying the scaling limits of many two-dimensional lattice models from statistical physics. In this talk, I will discuss the proofs of the reversibility conjecture and duality conjecture about SLE. The proofs of these two conjectures use the same idea, which is to use a coupling technique to lift local couplings of two SLE processes that locally commute with each other to a global coupling. And from the global coupling, we can clearly see that the two conjectures hold.
Thursday, January 29, 2009 - 11:00 , Location: Skiles 269 , Brett Wick , University of South Carolina , Organizer: Doron Lubinsky
Carleson's Corona Theorem from the 1960's has served as a major motivation for many results in complex function theory, operator theory and harmonic analysis. In its simplest form, the result states that for two bounded analytic functions, g_1 and g_2, on the unit disc with no common zeros, it is possible to find two other bounded analytic functions, f_1 and f_2, such that f_1g_1+f_2g_2=1. Moreover, the functions f_1 and f_2 can be chosen with some norm control. In this talk we will discuss an exciting new generalization of this result to certain function spaces on the unit ball in several complex variables. In particular, we will highlight the Corona Theorem for the Drury-Arveson space and its applications in multi-variable operator theory.
Tuesday, January 20, 2009 - 15:00 , Location: Skiles 269 , Anton Leykin , University of Illinois at Chicago , Organizer: Stavros Garoufalidis
Numerical algebraic geometry provides a collection of novel methods to treat the solutions of systems of polynomial equations. These hybrid symbolic-numerical methods based on homotopy continuation technique have found a wide range of applications in both pure and applied areas of mathematics. This talk gives an introduction to numerical algebraic geometry and outlines directions in which the area has been developing. Two topics are highlighted: (1) computation of Galois groups of Schubert problems, a recent application of numerical polynomial homotopy continuation algorithms to enumerative algebraic geometry; (2) numerical primary decomposition, the first numerical method that discovers embedded solution components.

Pages