Seminars and Colloquia by Series

Thursday, September 11, 2008 - 15:00 , Location: Skiles 269 , Robert Foley , ISyE, Georgia Tech , Organizer: Heinrich Matzinger
Under certain conditions, we obtain exact asymptotic expressions for the stationary distribution \pi of a Markov chain.  In this talk, we will consider Markov chains on {0,1,...}^2.  We are particularly interested in deriving asymptotic expressions when the fluid limit of the most probable paths from the origin to the rare event are nonlinear.  For example, we will derive asymptotic expressions for a large deviation along the x-axis (e.g., \pi(\ell, y) for fixed y) when the most probable paths to (\ell,y) initially climb the y-axis before turning southwest and drifting towards (\ell,y).
Wednesday, September 10, 2008 - 13:00 , Location: ISyE Executive Classroom , Joel Sokol , ISyE, Georgia Tech , Organizer: Annette Rohrs
In order to estimate the spread of potential pandemic diseases and the efficiency of various containment policies, it is helpful to have an accurate model of the structure of human contact networks. The literature contains several explicit and implicit models, but none behave like actual network data with respect to the spread of disease. We discuss the difficulty of modeling real human networks, motivate the study of some open practical questions about network structure, and suggest some possible avenues of attack based on some related research.
Wednesday, September 10, 2008 - 12:00 , Location: Skiles 255 , Zhiwu Lin , School of Mathematics, Georgia Tech , Organizer:
A plasma is a gas of ionized particles. For a dilute plasma of very high temperature, the collisions can be ignored. Such situations occur, for example, in nuclear fusion devices and space plasmas. The Vlasov-Poisson and Vlasov-Maxwell equations are kinetic models for such collisionless plasmas. The Vlasov-Poisson equation is also used for galaxy evolution. I will describe some mathematical results on these models, including well-posedness and stability issues.
Wednesday, September 10, 2008 - 11:00 , Location: Skiles 255 , Michael Goodisman , School of Biology, Georgia Tech , Organizer: Christine Heitsch
The evolution of sociality represented one of the major transition points in biological history. Highly social animals such as social insects dominate ecological communities because of their complex cooperative and helping behaviors. We are interested in understanding how evolutionary processes affect social systems and how sociality, in turn, affects the course of evolution. Our research focuses on understanding the social structure and mating biology of social insects. In addition, we are interested in the process of development in the context of sociality. We have found that some social insect females mate with multiple males, and that this behavior affects the structure of colonies.  We have also found that colonies adjust their reproductive output in a coordinated and adaptive manner. Finally, we are investigating the molecular basis underlying the striking differences between queens and workers in highly social insects. Overall, our research provides insight into the function and evolutionary success of highly social organisms.
Series: PDE Seminar
Tuesday, September 9, 2008 - 15:15 , Location: Skiles 255 , Marta Lewicka , School of Mathematics, University of Minnesota , Organizer:
A longstanding problem in the mathematical theory of elasticity is to predict theories of lower-dimensional objects (such as rods, plates or shells), subject to mechanical deformations, starting from the 3d nonlinear theory. For plates, a recent effort (in particular work by Friesecke, James and Muller) has lead to rigorous justification of a hierarchy of such theories (membrane, Kirchhoff, von Karman). For shells, despite extensive use of their ad-hoc generalizations present in the engineering applications, much less is known from the mathematical point of view. In this talk, I will discuss the limiting behaviour (using the notion of Gamma-limit) of the 3d nonlinear elasticity for thin shells around an arbitrary smooth 2d mid-surface S. We prove that the minimizers of the 3d elastic energy converge, after suitable rescaling, to minimizers of a hierarchy of shell models. The limiting functionals (which for plates yield respectively the von Karman, linear, or linearized Kirchhoff theories) are intrinsically linked with the geometry of S. They are defined on the space of infinitesimal isometries of S (which replaces the 'out-of-plane-displacements' of plates), and the space of finite strains (which replaces strains of the `in-plane-displacements'), thus clarifying the effects of rigidity of S on the derived theories. The different limiting theories correspond to different magnitudes of the applied forces, in terms of the shell thickness. This is joint work with M. G. Mora and R. Pakzad.
Monday, September 8, 2008 - 16:30 , Location: Skiles 269 , Vadim Yu Kaloshin , Mathematics Department, Penn State , Organizer: Yingfei Yi
Consider the classical Newtonian three-body problem. Call motions oscillatory if as times tends to infinity limsup of maximal distance among the bodies is infinite, while liminf it finite. In the '50s Sitnitkov gave the first rigorous example of oscillatory motions for the so-called restricted three-body problem.  Later in the '60s Alexeev extended this example to the three-body. A long-standing conjecture, probably going back to Kolmogorov, is that oscillatory motions have measure zero. We show that for the Sitnitkov example and for the so-called restricted planar circular three-body problem these motions have maximal Hausdorff dimension. This is a joint work with Anton Gorodetski.
Monday, September 8, 2008 - 14:00 , Location: Skiles 269 , Roland van der Veen , University of Amsterdam , Organizer: Stavros Garoufalidis
The hyperbolic volume and the colored Jones polynomial are two of the most powerful invariants in knot theory. In this talk we aim to extend these invariants to arbitrary graphs embedded in 3-space. This provides new tools for studying questions about graph embedding and it also sheds some new light on the volume conjecture. According to this conjecture, the Jones polynomial and the volume of a knot are intimately related. In some special cases we will prove that this still holds true in the case of graphs.
Friday, September 5, 2008 - 15:00 , Location: Skiles 255 , Ernie Croot , School of Mathematics, Georgia Tech , Organizer: Prasad Tetali
Let A be a set of n real numbers. A central problem in additive combinatorics, due to Erdos and Szemeredi, is that of showing that either the sumset A+A or the product set A.A, must have close to n^2 elements. G. Elekes, in a short and brilliant paper, showed that one can give quite good bounds for this problem by invoking the Szemeredi-Trotter incidence theorem (applied to the grid (A+A) x (A.A)). Perhaps motivated by this result, J. Solymosi posed the following problem (actually, Solymosi's original problem is slightly different from the formulation I am about to give). Show that for every real c > 0, there exists 0 < d < 1, such that the following holds for all grids A x B with |A| = |B| = n sufficiently large: If one has a family of n^c lines in general position (no three meet at a point, no two parallel), at least one of them must fail to be n^(1-d)-rich -- i.e. at least one of then meets in the grid in fewer than n^(1-d) points. In this talk I will discuss a closely related result that I and Evan Borenstein have proved, and will perhaps discuss how we think we can use it to polish off this conjecture of Solymosi.
Thursday, September 4, 2008 - 15:00 , Location: Skiles 269 , Heinrich Matzinger , School of Mathematics, Georgia Tech , Organizer: Heinrich Matzinger
A common subsequence of two sequences X and Y is a sequence which is a subsequence of X as well as a subsequence of Y. A Longest Common Subsequence (LCS) of X and Y is a common subsequence with maximal length. Longest Common subsequences can be represented as alignments with gaps where the aligned letter pairs corresponds to the letters in the LCS. We consider two independent i.i.d.  binary texts X and Y of length n. We show that the behavior of the the alignment corresponding to the LCS is very different depending on the number of colors.  With 2-colors, long blocks tend to be aligned with no gaps, whilst for four or more colors the opposite is true. Let Ln denote the length of the LCS of X and Y.  In general the order of the variance of Ln is not known. We explain how a biased affect of a finite pattern can influence the order of the fluctuation of Ln.
Wednesday, September 3, 2008 - 12:00 , Location: Skiles 255 , Robin Thomas , School of Mathematics, Georgia Tech , Organizer:
I will explain and prove a beautiful and useful theorem of Alon and Tarsi that uses multivariate polynomials to guarantee, under suitable hypotheses, the existence of a coloring of a graph. The proof method, sometimes called a Combinatorial Nullstellensatz, has other applications in graph theory, combinatorics and number theory.

Pages