Seminars and Colloquia by Series

Thursday, September 10, 2009 - 15:00 , Location: Skiles 269 , Christian Houdré , Georgia Tech , Organizer:

Given a random word of size n whose letters are drawn independently
from an ordered alphabet of size m, the fluctuations of the shape of
the corresponding random RSK Young tableaux are investigated, when both
n and m converge together to infinity. If m does not grow too fast and
if the draws are uniform, the limiting shape is the same as the
limiting spectrum of the GUE. In the non-uniform case, a control of
both highest probabilities will ensure the convergence of the first row
of the tableau, i.e., of the length of the longest increasing
subsequence of the random word, towards the Tracy-Widom distribution.

Wednesday, September 9, 2009 - 14:00 , Location: Skiles 269 , Shannon Bishop , Georgia Tech , Organizer:
We describe how time-frequency analysis is used to analyze boundedness and Schatten class properties of pseudodifferential operators and Fourier integral operators.
Wednesday, September 9, 2009 - 13:00 , Location: Skiles 114 , Amy Novick-Cohen , Technion , Organizer: John McCuan
Grain boundaries within polycrystalline materials are known to be governed by motion by mean curvature. However, when the polycrystalline specimen is thin, such as in thin films, then the effects of the exterior surfaces start to play an important role. We consider two particularly simple geometries, an axi-symmetric geometry, and a half loop geometry which is often employed in making measurements of the kinetic coefficient in the motion by mean curvature equation, obtaining corrective terms which arise due to the coupling of grain boundaries to the exterior surface.   Joint work with Anna Rotman, Arkady Vilenkin & Olga Zelekman-Smirin
Series: Other Talks
Wednesday, September 9, 2009 - 13:00 , Location: Skiles 269 , John Etnyre , Ga Tech , Organizer: John Etnyre
In these talks we will introduced the basic definitions and examples of presheaves, sheaves and sheaf spaces. We will also explore various constructions and properties of these objects.
Wednesday, September 9, 2009 - 12:00 , Location: ISyE Executive Classroom , Steve Tyber , ISyE, Georgia Tech , Organizer: Annette Rohrs
In 1969, Gomory introduced the master group polyhedron for pure integer programs and derives the mixed integer cut (MIC) as a facet of a special family of these polyhedra. We study the MIC in this framework, characterizing both its facets and extreme points; next, we extend our results under mappings between group polyhedra; and finally, we conclude with related open problems. No prior knowledge of algebra or the group relaxation is assumed. Terminology will be introduced as needed. Joint work with Ellis Johnson.
Wednesday, September 9, 2009 - 12:00 , Location: Skiles 171 , Ernie Croot , School of Mathematics, Georgia Tech , ecroot@math.gatech.edu , Organizer:
Additive combinatorics is a relatively new field, with many diverse and exciting research programmes.  In this talk I will discuss two of these programmes -- the continuing development of sum-product inequalities, and the unfolding progress on arithmetic progressions -- along with some new results proved by me and my collaborators.  Hopefully I will have time to mention some nice research problems as well.
Series: PDE Seminar
Tuesday, September 8, 2009 - 15:05 , Location: Skiles 255 , Konstantina Trivisa , University of Maryland, College Park , Organizer:
Multicomponent reactive flows arise in many practical applicationssuch as combustion, atmospheric modelling, astrophysics, chemicalreactions, mathematical biology etc. The objective of this work isto develop a rigorous mathematical theory based on the principles ofcontinuum mechanics. Results on existence, stability, asymptotics as wellas singular limits will be discussed.
Monday, September 7, 2009 - 14:00 , Location: - , - , - , Organizer: John Etnyre
Friday, September 4, 2009 - 15:00 , Location: Skiles 255 , Karthekeyan Chandrasekaran , College of Computing , Organizer: Prasad Tetali
Lovasz Local Lemma (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small compared to the number of events that depend on it. It is often used in combination with the probabilistic method for non-constructive existence proofs. A prominent application of LLL is to k-CNF formulas, where LLL implies that, if every clause in the formula shares variables with at most d \le 2^k/e other clauses then such a formula has a satisfying assignment. Recently, a randomized algorithm to efficiently construct a satisfying assignment was given by Moser. Subsequently Moser and Tardos gave a randomized algorithm to construct the structures guaranteed by the LLL in a very general algorithmic framework. We will address the main problem left open by Moser and Tardos of derandomizing their algorithm efficiently when the number of other events that any bad event depends on is possibly unbounded. An interesting special case of the open problem is the k-CNF problem when k = \omega(1), that is, when k is more than a constant.
Friday, September 4, 2009 - 13:00 , Location: Skiles 255 , Maria Reguera Rodriguez , Georgia Tech , mreguera@math.gatech.edu , Organizer:
In this talk we will review some of the classical weighted theory for singular integral operators, and discuss some recent progress on finding sharp bounds in terms of the A_p constant associated with the weight

Pages