Seminars and Colloquia by Series

Stability of planar diffusion waves for bipolar hydrodynamic model of semiconductors in multi-dimensional space

Series
PDE Seminar
Time
Tuesday, March 1, 2011 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Prof. Ming MeiChamplain College and McGill University
In this talk, we consider the n-dimensional bipolar hydrodynamic model for semiconductors in the form of Euler-Poisson equations. In 1-D case, when the difference between the initial electron mass and the initial hole mass is non-zero (switch-on case), the stability of nonlinear diffusion wave has been open for a long time. In order to overcome this difficulty, we ingeniously construct some new correction functions to delete the gaps between the original solutions and the diffusion waves in L^2-space, so that we can deal with the one dimensional case for general perturbations, and prove the L^\infty-stability of diffusion waves in 1-D case. The optimal convergence rates are also obtained. Furthermore, based on the results of one-dimension, we establish some crucial energy estimates and apply a new but key inequality to prove the stability of planar diffusion waves in n-D case, which is the first result for the multi-dimensional bipolar hydrodynamic model of semiconductors, as we know. This is a joint work with Feimin Huang and Yong Wang.

Lecture series on the disjoint paths algorithm

Series
Graph Theory Seminar
Time
Monday, February 28, 2011 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 168
Speaker
Paul WollanSchool of Mathematics, Georgia Tech and University of Rome
The k-disjoint paths problem takes as input a graph G and k pairs of vertices (s_1, t_1),..., (s_k, t_k) and determines if there exist internally disjoint paths P_1,..., P_k such that the endpoints of P_i are s_i and t_i for all i=1,2,...,k. While the problem is NP-complete when k is allowed to be part of the input, Robertson and Seymour showed that there exists a polynomial time algorithm for fixed values of k. The existence of such an algorithm is the major algorithmic result of the Graph Minors series. The original proof of Robertson and Seymour relies on the whole theory of graph minors, and consequently is both quite technical and involved. Recent results have dramatically simplified the proof to the point where it is now feasible to present the proof in its entirety. This seminar series will do just that, with the level of detail aimed at a graduate student level.

On Automorphisms of the Hyperelliptic Torelli Group

Series
Geometry Topology Seminar
Time
Monday, February 28, 2011 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Leah ChildersPittsburg State U
We will discuss the structure of the symmetric (or hyperelliptic) Torelli group. More specifically, we will investigatethe group generated by Dehn twists about symmetric separating curvesdenoted by H(S). We will show that Aut(H(S)) is isomorphic to the symmetricmapping class group up to the hyperelliptic involution. We will do this bylooking at the natural action of H(S) on the symmetric separating curvecomplex and by giving an algebraic characterization of Dehn twists aboutsymmetric separating curves.

Vortex evolution and stability of fish swimming

Series
Applied and Computational Mathematics Seminar
Time
Monday, February 28, 2011 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Fangxu JingUSC Mechanical Engineering
Vortex dynamics and solid-fluid interaction are two of the most important and most studied topics in fluid dynamics for their relevance to a wide range of applications from geophysical flows to locomotion in moving fluids. In this talk, we investigate two problems in these two areas: Part I studies the viscous evolution of point vortex equilibria; Part II studies the effects of body elasticity on the passive stability of submerged bodies.In Part I, we describe the viscous evolution of point vortex configurations that, in the absence of viscosity, are in a state of fixed or relative equilibrium. In particular, we examine four cases, three of them correspond to relative equilibria in the inviscid point vortex model and one corresponds to a fixed equilibrium. Our goal is to elucidate some of the main transient dynamical features of the flow. Using a multi-Gaussian ``core growing" type of model, we show that all four configurations immediately begin to rotate unsteadily, while the shapes of vortex configurations remain unchanged. We then examine in detail the qualitative and quantitative evolution of the structures as they evolve, and for each case show the sequence of topological bifurcations that occur both in a fixed reference frame, and in an appropriately chosen rotating reference frame. Comparisons between the cases help to reveal different features of the viscous evolution for short and intermediate time ! scales of vortex structures. The dynamical evolution of passive particles in the viscously evolving flow associated with the initial fixed equilibrium is shown and interpreted in relation to the evolving streamline patterns. In Part II, we examine the effects of body geometry and elasticity on the passive stability of motion in a perfect fluid. Our main motivation is to understand the role of body elasticity on the stability of fish swimming. The fish is modeled as an articulated body made of multiple links (assumed to be identical ellipses in 2D or identical ellipsoids in 3D) interconnected by hinge joints. It can undergo shape changes by varying the relative angles between the links. Body elasticity is accounted for via the torsional springs at the joints. The unsteadiness of the flow is modeled using the added mass effect. Equations of motion for the body-fluid system are derived using Newtonian and Lagrangian approaches for both hydrodynamically decoupled and coupled models in 2D and 3D. We specifically examine the stability associated with a relative equilibrium of the equations, traditionally referred to as the ``coast motion" (proved to be unstable for a rigid elongated body model), and f! ound that body elasticity does stabilize the system. Stable regions are identified based on linear stability analysis in the parameter space spanned by aspect ratio (body geometry) and spring constants (muscle stiffness), and the findings based on the linear analysis are verified by direct numerical simulations of the nonlinear system.

Longest Cycles in Graphs with Given Independence Number and Connectivity.

Series
Combinatorics Seminar
Time
Friday, February 25, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Hehui WuUniversity of Illinois at Urbana-Champaign
The Chv\'atal--Erd\H{o}s Theorem states that every graph whose connectivityis at least its independence number has a spanning cycle. In 1976, Fouquet andJolivet conjectured an extension: If $G$ is an $n$-vertex $k$-connectedgraph with independence number $a$, and $a \ge k$, then $G$ has a cycle of lengthat least $\frac{k(n+a-k)}{a}$. We prove this conjecture. This is joint work with Suil O and Douglas B. West.

Tangent lines and torsion of closed space curves

Series
Geometry Topology Working Seminar
Time
Friday, February 25, 2011 - 14:00 for 2 hours
Location
Skiles 269
Speaker
Mohammad GhomiGa Tech
Torsion of a curve in Euclidean 3-space is a quantity which together with the curvature completely determines the curve up to a rigid motion. In this talk we use the curve shortening flow to show that the number of zero torsion points (or vertices) v a closed space curve c and the number p of the pair of parallel tangent lines of c satisfy the following sharp inequality: v + 2p > 5.

Generating Torelli groups

Series
Geometry Topology Working Seminar
Time
Friday, February 25, 2011 - 14:00 for 1.5 hours (actually 80 minutes)
Location
Skiles 269
Speaker
Dan MargalitGaTech
I'll present a new, simple proof that the Torelli group is generated by (infinitely many) bounding pair maps. At the end, I'll explain an application of this approach to the hyperelliptic Torelli group. The key is to take advantage of the "complex of minimizing cycles."

Four Seemingly Unrelated Problems

Series
Algebra Seminar
Time
Friday, February 25, 2011 - 13:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Michael FilasetaUniversity of South Carolina
We begin this talk by discussing four different problems that arenumber theoretic or combinatorial in nature. Two of these problems remainopen and the other two have known solutions. We then explain how these seeminglyunrelated problems are connected to each other. To disclose a little more information,one of the problems with a known solution is the following: Is it possible to find anirrational number $q$ such that the infinite geometric sequence $1, q, q^{2}, \dots$has 4 terms in arithmetic progression?

Online Matching and the Adwords Market

Series
ACO Seminar
Time
Thursday, February 24, 2011 - 16:30 for 1 hour (actually 50 minutes)
Location
KACB 1116B
Speaker
Aranyak MehtaGoogle Research
The spectacular success of search and display advertising -- to businesses and search engine companies -- and its huge growth potential has attracted the attention of researchers from many aspects of computer science. Since a core problem in this area is that of effective ad allocation, an inherently algorithmic and game-theoretic question, numerous theoreticians have worked in this area in recent years. Ad allocation involves matching ad slots to advertisers, under demand and supply constraints. In short, the better the matching, the more efficient the market. Interestingly, the seminal work on online matching, by Karp, Vazirani and Vazirani, was done over two decades ago, well before the advent of the Internet economy! In this talk, I will give an overview of several key algorithmic papers in this area, starting with its purely academic beginnings, to papers that actually address the Adwords problem. The elegant -- and deep -- theory behind these algorithms involves new combinatorial, probabilistic and linear programming techniques. Besides the classic KVV paper (STOC 1990), this talk will refer to several papers with my co-authors: Mehta, Saberi, Vazirani, Vazirani (FOCS 05, J. ACM 07), Goel, Mehta (SODA 08), Feldman, Mehta, Mirrokni, Muthukrishnan (FOCS 09), Aggarwal, Goel, Karande, Mehta (SODA 10), Karande, Mehta, Tripathi (STOC 11).

The Convex Geometry of Inverse Problems

Series
Stochastics Seminar
Time
Thursday, February 24, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skyles 005
Speaker
Ben RechtComputer Sciences Department, University of Wisconsin
Deducing the state or structure of a system from partial, noisy measurements is a fundamental task throughout the sciences and engineering. The resulting inverse problems are often ill-posed because there are fewer measurements available than the ambient dimension of the model to be estimated. In practice, however, many interesting signals or models contain few degrees of freedom relative to their ambient dimension: a small number of genes may constitute the signature of a disease, very few parameters may specify the correlation structure of a time series, or a sparse collection of geometric constraints may determine a molecular configuration. Discovering, leveraging, or recognizing such low-dimensional structure plays an important role in making inverse problems well-posed. In this talk, I will propose a unified approach to transform notions of simplicity and latent low-dimensionality into convex penalty functions. This approach builds on the success of generalizing compressed sensing to matrix completion, and greatly extends the catalog of objects and structures that can be recovered from partial information. I will focus on a suite of data analysis algorithms designed to decompose general signals into sums of atoms from a simple---but not necessarily discrete---set. These algorithms are derived in a convex optimization framework that encompasses previous methods based on l1-norm minimization and nuclear norm minimization for recovering sparse vectors and low-rank matrices. I will provide sharp estimates of the number of generic measurements required for exact and robust recovery of a variety of structured models. These estimates are based on computing certain Gaussian statistics related to the latent model geometry. I will detail several example applications and describe how to scale the corresponding inference algorithms to very large data sets. (Joint work with Venkat Chandrasekaran, Pablo Parrilo, and Alan Willsky)

Pages