Seminars and Colloquia by Series

Hyperbolic volume and the complexity of Heegaard splittings of 3-manifolds

Series
Geometry Topology Seminar
Time
Monday, March 30, 2009 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 269
Speaker
Yo'av Rieck University of Arkansas
Let M be a hyperbolic 3-manifold, that is, a 3-manifold admitting a complete, finite volume Riemannian metric of constant section curvature -1. Let S be a Heegaard surface in M, that is, M cut open along S consists of two handlebodies. Our goal is to prove that is the volume of M (denoted Vol(M)) if small than S is simple. To that end we define two complexities for Heegaard surfaces. The first is the genus of the surface (denoted g(S)) and the second is the distance of the surface, as defined by Hempel (denoted d(S)). We prove that there exists a constant K>0 so that for a generic manifold M, if g(S) \geq 76KVol(M) + 26, then d(S) \leq 2. Thus we see that for a generic manifold of small volume, either the genus of S is small or its distance is at most two. The term generic will be explained in the talk.

A variational method for the classification, segmentation and denoising of a time series field

Series
Applied and Computational Mathematics Seminar
Time
Monday, March 30, 2009 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 255
Speaker
Richardo MarchIstituto per le Applicazioni del Calcolo "Mauro Picone" of C.N.R.
We consider ordered sequences of digital images. At a given pixel a time course is observed which is related to the time courses at neighbour pixels. Useful information can be extracted from a set of such observations by classifying pixels in groups, according to some features of interest. We assume to observe a noisy version of a positive function depending on space and time, which is parameterized by a vector of unknown functions (depending on space) with discontinuities which separate regions with different features in the image domain. We propose a variational method which allows to estimate the parameter functions, to segment the image domain in regions, and to assign to each region a label according to the values that the parameters assume on the region. Approximation by \Gamma-convergence is used to design a numerical scheme. Numerical results are reported for a dynamic Magnetic Resonance imaging problem.

Coupling and the Kac’s random walk

Series
Probability Working Seminar
Time
Friday, March 27, 2009 - 16:00 for 1 hour (actually 50 minutes)
Location
Skiles 268
Speaker
Ricardo RestrepoSchool of Mathematics, Georgia Tech
This talk is based in the article titled "On the convergence to equilibrium of Kac’s random walk on matrices" by Roberto Oliveira (IMPA, Brazil). We show how a strategy related to the path coupling method allows us to establish tight bounds for the L-2 transportation-cost mixing time of the Kac's random walk on SO(n).

On the chromatic number of a random d-regular graph

Series
Combinatorics Seminar
Time
Friday, March 27, 2009 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 255
Speaker
Graeme KemkesUCSD
Choose a graph uniformly at random from all d-regular graphs on n vertices. We determine the chromatic number of the graph for about half of all values of d, asymptotically almost surely (a.a.s.) as n grows large. Letting k be the smallest integer satisfying d < 2(k-1)\log(k-1), we show that a random d-regular graph is k-colorable a.a.s. Together with previous results of Molloy and Reed, this establishes the chromatic number as a.a.s. k-1 or k. If furthermore d>(2k-3)\log(k-1) then the chromatic number is a.a.s. k. This is an improvement upon results recently announced by Achlioptas and Moore. The method used is "small subgraph conditioning'' of Robinson and Wormald, applied to count colorings where all color classes have the same size. It is the first rigorously proved result about the chromatic number of random graphs that was proved by small subgraph conditioning. This is joint work with Xavier Perez-Gimenez and Nick Wormald.

Longest Increasing Subsequence for Finite Alphabets

Series
SIAM Student Seminar
Time
Friday, March 27, 2009 - 12:30 for 2 hours
Location
Skiles 255
Speaker
Huy HuynhSchool of Mathematics, Georgia Tech
This is due to the paper of Dr. Christian Houdre and Trevis Litherland. Let X_1, X_2,..., X_n be a sequence of iid random variables drawn uniformly from a finite ordered alphabets (a_1,...,a_m) where a_1 < a_2 < ...< a_m. Let LI_n be the length of the longest increasing subsequence of X_1,X_2,...,X_n. We'll express the limit distribution of LI_n as functionals of (m-1)-dimensional Brownian motion. This is an elementary case taken from this paper.

On the dimension of the Navier-Stokes singular set

Series
School of Mathematics Colloquium
Time
Thursday, March 26, 2009 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 269
Speaker
Walter CraigMcMaster University
A new estimate on weak solutions of the Navier-Stokes equations in three dimensions gives some information about the partial regularity of solutions. In particular, if energy concentration takes place, the dimension of the microlocal singular set cannot be too small. This estimate has a dynamical systems proof. These results are joint work with M. Arnold and A. Biryuk.

Twistor Theory, Then and Now

Series
Other Talks
Time
Wednesday, March 25, 2009 - 15:00 for 1 hour (actually 50 minutes)
Location
Howey Physics Lecture Room 5
Speaker
Roger PenroseMathematical Institute, University of Oxford
Twistor theory is now over 45 years old. In December 1963, I proposed the initial ideas of this scheme, based on complex-number geometry, which presents an alternative perspective to that of standard 4-dimensional space-time, for the basic arena in which (quantum) physics takes place. Over the succeeding years, there were numerous intriguing developments. But many of these were primarily mathematical, and there was little interest expressed by the physics community. Things changed rather dramatically, in December 2003, when E. Witten produced a 99-page article initiating the subject of “twistor-string theory” this providing a novel approach to high-energy scattering processes. In this talk, I shall provide an account of the original geometrical and physical ideas, and also outline various recent developments, some of which may help our understandings of the seeming paradoxes of quantum mechanics.

Efficient Sampling on Lattices

Series
ACO Student Seminar
Time
Wednesday, March 25, 2009 - 13:30 for 2 hours
Location
ISyE Executive Classroom
Speaker
Dana RandallComputer Science, Georgia Tech
We will survey some old, some new, and some open problems in the area of efficient sampling. We will focus on sampling combinatorial structures (such as perfect matchings and independent sets) on regular lattices. These problems arise in statistical physics, where sampling objects on lattices can be used to determine many thermodynamic properties of simple physical systems. For example, perfect matchings on the Cartesian lattice, more commonly referred to as domino tilings of the chessboard, correspond to systems of diatomic molecules. But most importantly they are just cool problems with some beautiful solutions and a surprising number of unsolved challenges!

Domain Decompostion Methods for Stokes Equations

Series
Applied and Computational Mathematics Seminar
Time
Wednesday, March 25, 2009 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 255
Speaker
Junping WangNSF
This talk will first review domain decomposition methods for second order elliptic equations, which should be accessible to graduate students. The second part of the talk will deal with possible extensions to the Stokes equation when discretized by finite element methods. In particular, we shall point out the difficulties in such a generalization, and then discuss ways to overcome the difficulties.

Stabilization of multimeric enzymes: structural adaptation to stress conditions

Series
Mathematical Biology Seminar
Time
Wednesday, March 25, 2009 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 255
Speaker
Ruslan RafikovMedical College of Georgia
The stress condition calls for an adequate activity of key enzymatic systems of cellular defense. Massive protein destabilization and degradation is occurring in stressed cells. The rate of protein re-synthesis (DNA->RNA->protein) is inadequate to adapt to rapidly changing environment. Therefore, an alternative mechanism should exist maintaining sufficient activity of defense enzymes. Interestingly, more than 50% of enzymes consist of identical subunits which are forming multimeric interface. Stabilization of multimers is important for enzymatic activity. We found that it can be achieved by the formation of inter-subunit covalent bridges in response to stress conditions. It shows an elegance of the structure design that directs selective subunits linkage and increases enzyme's robustness and chances of cell survival during the stress. In contrast, modification of aminoacids involved in linkage leads to protein destabilization, unfolding and degradation. These results describe a new instantaneous mechanism of structural adaptation that controls enzymatic system under stress condition.

Pages