Seminars and Colloquia by Series

Wednesday, December 2, 2009 - 11:00 , Location: Skiles 269 , Laura Miller , University of North Carolina at Chapel Hill , Organizer: Christine Heitsch
The Reynolds number (Re) is often used to describe scaling effects in fluid dynamics and may be thought of as roughly describing the ratio of inertial to viscous forces in the fluid. It can be shown that ’reciprocal’ methods of macroscopic propulsion (e.g. flapping, undulating, and jetting) do not work in the limit as Re approaches zero. However, such macroscopic forms of locomotion do not appear in nature below Re on the order of 1 − 10.  Similarly, macroscopic forms of feeding do not occur below a similar range of Reynolds numbers. The focus of this presentation is to describe the scaling effects in feeding and swimming of the upside down jellyfish (Cassiopeia sp.) using computational fluid dynamics and experiments with live animals. The immersed boundary method is used to solve the Navier-Stokes equations with an immersed, flexible boundary. Particle image velocimetry is used to quantify the flow field around the live jellyfish and compare it to the simulations.
Series: PDE Seminar
Tuesday, December 1, 2009 - 15:01 , Location: Skiles 255 , Jose Arrieta , Universidad Complutense de Madrid; visiting faculty at GT , Organizer:
 In this talk we will present several results concerning the behavior of the Laplace operator with Neumann boundary conditions in a thin domain where its boundary presents a  highly oscillatory behavior.  Using homogenization and domain perturbation techniques, we obtain the asymptotic limit as the thickness of the domain goes to zero even for the case where the oscillations are not necessarily periodic.  We will also indicate how this result can be applied to analyze the asymptotic dynamics of reaction diffusion equations in these domains.
Monday, November 30, 2009 - 14:05 , Location: Skiles 269 , Stavros Garoufalidis , Georgia Tech , , Organizer: Stavros Garoufalidis
I will discuss a conjecture that relates the degree of the Jones polynomial of a knot and its parallels with the slopes of incompressible surfaces in the knot complement. I will present examples, as well as computational challenges.
Monday, November 30, 2009 - 14:00 , Location: Skiles 255 , Brett Wick , Georgia Tech , Organizer:
We are going to finish explaining the proof of Seip's Interpolation Theorem for the Bergman Space.  This will be the last meeting of the seminar for the semester.
Monday, November 30, 2009 - 12:00 , Location: Skiles 269 , David Hu , Georgia Tech ME , Organizer:
How do animals move without legs? In this experimental and theoretical study, we investigate the slithering of snakes on flat surfaces. Previous studies of slithering have rested on the assumption that snakes slither by pushing laterally against rocks and branches. In this combined experimental and theoretical study, we develop a model for slithering locomotion by observing snake motion kinematics and experimentally measuring the friction coefficients of snake skin. Our predictions of body speed show good agreement with observations, demonstrating that snake propulsion on flat ground, and possibly in general, relies critically on the frictional anisotropy of their scales. We also highlight the importance of the snake's dynamically redistributing its weight during locomotion in order to improve speed and efficiency. We conclude with an overview of our experimental observations of other methods of propulsion by snakes, including sidewinding and a unidirectional accordion-like mode.
Monday, November 30, 2009 - 11:00 , Location: Skiles 269 , Maria Lopez , Consejo Superior de Investigaciones Cientificas Madrid, Spain , Organizer: Yingfei Yi
We introduce a change of coordinates allowing to capture in a fixed reference frame the profile of travelling wave solutions for nonlinear parabolic equations. For nonlinearities of bistable type the asymptotic travelling wave profile becomes an equilibrium state for the augmented reaction-diffusion equation. In the new equation, the profile of the asymptotic travelling front and its propagation speed emerge simultaneously as time evolves. Several numerical experiments illustrate the effciency of the method.
Series: Other Talks
Wednesday, November 25, 2009 - 13:00 , Location: Skiles 255 , Matt Baker , School of Mathematics, Georgia Tech , Organizer: Matt Baker
We will state Serre's fundamental finiteness and vanishing results for the cohomology of coherent sheaves on a projective algebraic variety. As an application, we'll prove that the constant term of the Hilbert Polynomial does not depend on the projective embedding, a fact which is hard to understand using classical (non-cohomological) methods.
Monday, November 23, 2009 - 15:30 , Location: Skiles 255 , Anton Leykin , Georgia Tech , Organizer: Matt Baker
This talk will start with an introduction to the area of numerical algebraic geometry. The homotopy continuation algorithms that it currently utilizes are based on heuristics: in general their results are not certified. Jointly with Carlos Beltran, using recent developments in theoretical complexity analysis of numerical computation, we have implemented a practical homotopy tracking algorithm that provides the status of a mathematical proof to its approximate numerical output.
Monday, November 23, 2009 - 14:00 , Location: Skiles 269 , Hong-Van Le , Mathematical Institute of Academy of Sciences of the Czech Republic , Organizer: Thang Le
In 1979 Valiant gave algebraic analogs to algorithmic complexity problem such as $P \not = NP$. His central conjecture concerns the determinantal complexity of the permanents. In my lecture I shall propose geometric and algebraic methods to attack this problem and other lower bound problems based on the elusive functions approach by Raz. In particular I shall give new algorithms to get lower bounds for determinantal complexity of polynomials over $Q$, $R$ and $C$.
Monday, November 23, 2009 - 13:00 , Location: Skiles 255 , Xiaoming Huo , Georgia Tech (School of ISyE) , , Organizer: Sung Ha Kang
Many algorithms were proposed in the past ten years on utilizing manifold structure for dimension reduction. Interestingly, many algorithms ended up with computing for eigen-subspaces. Applying theorems from matrix perturbation, we study the consistency and rate of convergence of some manifold-based learning algorithm. In particular, we studied local tangent space alignment (Zhang & Zha 2004) and give a worst-case upper bound on its performance. Some conjectures on the rate of convergence are made. It's a joint work with a former student, Andrew Smith.