Seminars and Colloquia by Series

Friday, October 3, 2008 - 15:00 , Location: Skiles 255 , Ian Goulden , University of Waterloo , Organizer: Stavros Garoufalidis
This is an expository account of recent work on the enumeration of maps (graphs embedded on a surface of arbitrary genus) and branched covers of the sphere.  These combinatorial and geometric objects can both be represented by permutation factorizations, in the which the subgroup generated by the factors acts transitively on the underlying symbols (these are called "transitive factorizations"). Various results and methods are discussed, including a number of methods from mathematical physics, such as matrix integrals and the KP hierarchy of integrable systems. A notable example of the results is a recent recurrence for triangulations of a surface of arbitrary genus obtained from the simplest partial differential equation in the KP hierarchy. The recurrence is very simple, but we do not know a combinatorial interpretation of it, yet it leads to precise asymptotics for the number of triangulations with n edges, of a surface of genus g.
Friday, October 3, 2008 - 14:00 , Location: Skiles 269 , Tony Pantev , Dept of Mathematics, University of Penn , Organizer: Stavros Garoufalidis
I will describe a framework which relates large N duality to the geometry of degenerating Calabi-Yau spaces and the Hitchin integrable system. I will give a geometric interpretation of the Dijkgraaf-Vafa large N quantization procedure in this context.
Thursday, October 2, 2008 - 15:00 , Location: Skiles 269 , Mark Huber , Departments of Mathematics and Statistical Sciences, Duke University , Organizer: Heinrich Matzinger
Spatial data are often more dispersed than would be expected if the points were independently placed. Such data can be modeled with repulsive point processes, where the points appear as if they are repelling one another. Various models have been created to deal with this phenomenon. Matern created three algorithms that generate repulsive processes. Here, Matérn Type III processes are used to approximate the likelihood and posterior values for data. Perfect simulation methods are used to draw auxiliary variables for each spatial point that are part of the type III process.
Thursday, October 2, 2008 - 11:00 , Location: Skiles 269 , John Etnyre , School of Mathematics, Georgia Tech , Organizer: Guillermo Goldsztein
Describe the trajectories of particles floating in a liquid. This is a surprisingly difficult problem and attempts to understand it have involved many diverse techniques. In the 60's Arold, Marsden, Ebin and others began to introduce topological techniques into the study of fluid flows. In this talk we will discuss some of these ideas and see how they naturally lead to the introduction of contact geometry into the study of fluid flows. We then consider some of the results one can obtain from this contact geometry perspective. For example we will show that for a sufficiently smooth steady ideal fluid flowing in the three sphere there is always some particle whose trajectory is a closed loop that bounds an embedded disk, and that (generically) certain steady Euler flows are (linearly) unstable.
Thursday, October 2, 2008 - 11:00 , Location: Skiles 269 , John Etnyre , School of Mathematics, Georgia Tech , Organizer: Guillermo Goldsztein
Describe the trajectories of particles floating in a liquid. This is a surprisingly difficult problem and attempts to understand it have involved many diverse techniques. In the 60's Arold, Marsden, Ebin and others began to introduce topological techniques into the study of fluid flows. In this talk we will discuss some of these ideas and see how they naturally lead to the introduction of contact geometry into the study of fluid flows. We then consider some of the results one can obtain from this contact geometry perspective. For example we will show that for a sufficiently smooth steady ideal fluid flowing in the three sphere there is always some particle whose trajectory is a closed loop that bounds an embedded disk, and that (generically) certain steady Euler flows are (linearly) unstable.
Wednesday, October 1, 2008 - 13:30 , Location: ISyE Executive Classroom , Daniel Dadush , ACO, Georgia Tech , Organizer: Annette Rohrs
Constraint Programming is a powerful technique developed by the Computer Science community to solve combinatorial problems. I will present the model, explain constraint propagation and arc consistency, and give some basic search heuristics. I will also go through some illustrative examples to show the solution process works.
Wednesday, October 1, 2008 - 12:00 , Location: Skiles 255 , Roland van der Veen , University of Amsterdam , Organizer:
In this introduction to knot theory we will focus on a class of knots called rational knots. Here the word rational refers to a beautiful theorem by J. Conway that sets up a one to one correspondence between these knots and the rational numbers using continued fractions. We aim to give an elementary proof of Conway's theorem and discuss its application to the study of DNA recombination. No knowledge of topology is assumed.
Wednesday, October 1, 2008 - 11:00 , Location: Skiles 255 , John Drake , UGA , Organizer:
Series: PDE Seminar
Tuesday, September 30, 2008 - 15:15 , Location: Skiles 255 , Marian Bocea , North Dakota State University, Fargo , Organizer:
The yield set of a polycrystal may be characterized using variational principles associated to suitable supremal functionals. I will describe some model problems for which these can be obtained via Gamma-convergence of a class of "power-law" functionals acting on fields satisfying appropriate differential constraints, and I will indicate some PDEs which play a role in the analysis of these problems.
Monday, September 29, 2008 - 14:00 , Location: Skiles 255 , Wing Suet Li , School of Mathematics, Georgia Tech , Organizer: Plamen Iliev
The Horn inequalities give a characterization of eigenvalues of self-adjoint n by n matrices A, B, C with A+B+C=0. The proof requires powerful tools from algebraic geometry. In this talk I will talk about our recent result of these inequalities that are indeed valid for self-adjoint operators of an arbitrary finite factors. Since in this setting there is no readily available machinery from algebraic geometry, we are forced to look for an analysts friendly proof. A (complete) matricial form of our result is known to imply an affirmative answer to the Connes' embedding problem. Geometers especially welcome!

Pages