Seminars and Colloquia by Series

Thursday, January 15, 2009 - 11:00 , Location: Skiles 269 , Igor Pritzker , Oklahoma State University , Organizer: Guillermo Goldsztein
Issai Schur (1918) considered a class of polynomials with integer coefficients and simple zeros in the closed unit disk. He studied the limit behavior of the arithmetic means s_n for zeros of such polynomials as the degree n tends to infinity. Under the assumption that the leading coefficients are bounded, Schur proved that \limsup_{n\to\infty} |s_n| \le 1-\sqrt{e}/2. We show that \lim_{n\to\infty} s_n = 0 as a consequence of the asymptotic equidistribution of zeros near the unit circle. Furthermore, we estimate the rate of convergence of s_n to 0. These results follow from our generalization of the Erdos-Turan theorem on discrepancy in angular equidistribution of zeros. We give a range of applications to polynomials with integer coefficients. In particular, we show that integer polynomials have some unexpected restrictions of growth on the unit disk. Schur also studied problems on means of algebraic numbers on the real line. When all conjugate algebraic numbers are positive, the problem of finding \liminf_{n\to\infty} s_n was developed further by Siegel and many others. We provide a solution of this problem for algebraic numbers equidistributed in subsets of the real line.
Wednesday, January 14, 2009 - 12:00 , Location: Skiles 255 , Stavros Garoufalidis , School of Mathematics, Georgia Tech , Organizer:
The Apery sequence is a sequence of natural numbers 1,5,73,1445,...which is used to prove the irrationality of zeta(3). Can you compute its asymptotic expansion to all orders of 1/n? The talk will not assume a lot, but promises to compute, and also justify.
Monday, January 12, 2009 - 15:00 , Location: Skiles 269 , Robert Seiringer , Princeton University , Organizer: Michael Loss
We present an overview of mathematical results on the low temperature properties of dilute quantum gases, which have been obtained in the past few years. The discussion includes, for instance, results on the free energy in the thermodynamic limit, and on Bose-Einstein condensation, Superfluidity and quantized vortices in trapped gases. All these properties are intensely being studied in current experiments on cold atomic gases. We will give a brief description of the mathematics involved in understanding these phenomena, starting from the underlying many-body Schroedinger equation.
Monday, January 12, 2009 - 13:00 , Location: Skiles 255 , Frank Crosby , Naval Surface Warfare Center, Panama City , Organizer: Haomin Zhou
Several imaging innovations have been designed to find hidden objects in coastal areas of entry, such as beaches and ports. Each imaging device is designed to exploit particular distinguishing characteristics. This talk with cover using a tunable multi-spectral camera for polarization based detection and object identification with a flash LIDAR camera that produces three-dimensional imagery.
Thursday, January 8, 2009 - 15:00 , Location: Skiles 269 , Noureddine El Karoui , UC Berkeley , Organizer: Ionel Popescu
It is now increasingly common in statistical practice to encounter datasets in which the number of observations, n, is of the same order of magnitude as the number of measurements, p, we have per observation. This simple remark has important consequences for theoretical (and applied) statistics. Namely, it suggests on the theoretical front that we should study the properties of statistical procedures in an asymptotic framework where p and n both go to infinity (and p/n has for instance a finite non-zero limit). This is drastically different from the classical theory where p is held fixed when n goes to infinity. Since a number of techniques in multivariate statistics rely fundamentally on sample covariance matrices and their eigenvalues and eigenvectors, the spectral properties of large dimensional covariance matrices play a key role in such "large n, large p" analyses. In this talk, I will present a few problems I have worked on, concerning different aspects of the interaction between random matrix theory and multivariate statistics. I will discuss some fluctuation properties of the largest eigenvalue of sample covariance matrices when the population covariance is (fairly) general, talk about estimation problems for large dimensional covariance matrices and, time permitting, address some applications in a classic problem of mathematical finance. The talk will be self-contained and no prior knowledge of statistics or random matrix theory will be assumed.
Wednesday, January 7, 2009 - 15:00 , Location: Skiles 255 , Mike Zieve , IAS , Organizer: Matt Baker
I will present properties of polynomials mappings and generalizations. I will first describe all polynomials f and g for which there is a complex number c such that the orbits {c, f(c), f(f(c)), ...} and {c, g(c), g(g(c)), ...} have infinite intersection. I will also discuss a common generalization of this result and Mordell's conjecture (Faltings' theorem). After this I will move to polynomial mappings over finite fields, with connections to curves having large automorphism groups and instances of a positive characteristic analogue of Riemann's existence theorem.
Friday, December 12, 2008 - 14:00 , Location: Skiles 269 , Joel Zinn , Texas A&M University , Organizer: Heinrich Matzinger
In this approach to the Gaussian Correlation Conjecture we must check the log-concavity of the moment generating function of certain measures pulled down by a particular Gaussian density.
Series: Other Talks
Friday, December 12, 2008 - 09:00 , Location: Skiles 243 , Various Speakers , Various Universities , Organizer: Mohammad Ghomi
The Southeast Geometry Seminar (SGS) is a semiannual series of one day events organized by Vladimir Oliker (Emory), Mohammad Ghomi and John McCuan (Georgia Tech) and Gilbert Weinstein (UAB). See http://www.math.uab.edu/sgs for details
Series: PDE Seminar
Thursday, December 11, 2008 - 15:15 , Location: Skiles 255 , Robert Finn , Stanford University , Organizer: John McCuan
We calculate numerically the solutions of the stationary Navier-Stokes equations in two dimensions, for a square domain with particular choices of boundary data. The data are chosen to test whether bounded disturbances on the boundary can be expected to spread into the interior of the domain. The results indicate that such behavior indeed can occur, but suggest an estimate of general form for the magnitudes of the solution and of its derivatives, analogous to classical bounds for harmonic functions. The qualitative behavior of the solutions we found displayed some striking and unexpected features. As a corollary of the study, we obtain two new examples of non-uniqueness for stationary solutions at large Reynolds numbers.
Friday, December 5, 2008 - 15:00 , Location: Skiles 255 , Luis Rademacher , School of Computer Science, Georgia Tech , Organizer: Prasad Tetali
Expanders via Random Spanning Trees Motivated by the problem of routing reliably and scalably in a graph, we introduce the notion of a splicer, the union of spanning trees of a graph. We prove that for any bounded-degree n-vertex graph, the union of two random spanning trees approximates the expansion of every cut of the graph to within a factor of O(log n). For the random graph G_{n,p}, for p > c (log n)/n, two spanning trees give an expander. This is suggested by the case of the complete graph, where we prove that two random spanning trees give an expander. The construction of the splicer is elementary — each spanning tree can be produced independently using an algorithm by Aldous and Broder: a random walk in the graph with edges leading to previously unvisited vertices included in the tree. A second important application of splicers is to graph sparsification where the goal is to approximate every cut (and more generally the quadratic form of the Laplacian) using only a small subgraph of the original graph. Benczur-Karger as well as Spielman-Srivastava have shown sparsifiers with O(n log n/eps^2) edges that achieve approximation within factors 1+eps and 1-eps. Their methods, based on independent sampling of edges, need Omega(n log n) edges to get any approximation (else the subgraph could be disconnected) and leave open the question of linear-size sparsifiers. Splicers address this question for random graphs by providing sparsifiers of size O(n) that approximate every cut to within a factor of O(log n). This is joint work with Navin Goyal and Santosh Vempala.

Pages