Seminars and Colloquia by Series

Monday, March 30, 2009 - 16:30 , Location: Skiles 255 , Ton Dieker , ISyE, Georgia Tech , Organizer: Yingfei Yi
Allocation of service capacity ('staffing') at stations in queueing networks is both of fundamental and practical interest. Unfortunately, the problem is mathematically intractable in general and one therefore typically resorts to approximations or computer simulation. This talk describes work in progress with M. Squillante and S. Ghosh (IBM Research) on an algorithm that serves as an approximation for the 'best' capacity allocation rule. The algorithm can be interpreted as a discrete-time dynamical system, and we are interested in uniqueness of a fixed point and in convergence properties. No prior knowledge on queueing networks will be assumed.
Monday, March 30, 2009 - 15:00 , Location: Skiles 255 , Jeff Geronimo , School of Mathematics, Georgia Tech , Organizer: Jeff Geronimo
The contracted asymptotics for orthogonal polynomials whose recurrence coefficients tend to infinity will be discussed. The connection between the equilibrium measure for potential problems with external fields will be exhibited. Applications will be presented which include the Wilson polynomials.
Monday, March 30, 2009 - 13:00 , Location: Skiles 269 , Yo'av Rieck , University of Arkansas , Organizer: John Etnyre
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.
Monday, March 30, 2009 - 13:00 , Location: Skiles 255 , Richardo March , Istituto per le Applicazioni del Calcolo "Mauro Picone" of C.N.R. , Organizer: Haomin Zhou
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.
Friday, March 27, 2009 - 16:00 , Location: Skiles 268 , Ricardo Restrepo , School of Mathematics, Georgia Tech , Organizer:
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).
Friday, March 27, 2009 - 15:00 , Location: Skiles 255 , Graeme Kemkes , UCSD , Organizer: Prasad Tetali
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.
Friday, March 27, 2009 - 12:30 , Location: Skiles 255 , Huy Huynh , School of Mathematics, Georgia Tech , Organizer:
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.
Thursday, March 26, 2009 - 11:00 , Location: Skiles 269 , Walter Craig , McMaster University , Organizer: Guillermo Goldsztein
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.
Series: Other Talks
Wednesday, March 25, 2009 - 15:00 , Location: Howey Physics Lecture Room 5 , Roger Penrose , Mathematical Institute, University of Oxford , Organizer: Stavros Garoufalidis
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.
Wednesday, March 25, 2009 - 13:30 , Location: ISyE Executive Classroom , Dana Randall , Computer Science, Georgia Tech , Organizer: Annette Rohrs
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!