Seminars and Colloquia by Series

Decorated Teichmuller theory and the space of filtered screens

Series
Geometry Topology Seminar
Time
Monday, November 28, 2011 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Doug LaFountainAarhus Universitet
For a genus g surface with s > 0 punctures and 2g+s > 2, decorated Teichmuller space (DTeich) is a trivial R_+^s-bundle over the usual Teichmuller space, where the fiber corresponds to families of horocycles peripheral to each puncture. As proved by R. Penner, DTeich admits a mapping class group-invariant cell decomposition, which then descends to a cell decomposition of Riemann's moduli space. In this talk we introduce a new cellular bordification of DTeich which is also MCG-invariant, namely the space of filtered screens. After an appropriate quotient, we obtain a cell decomposition for a new compactification of moduli space, which is shown to be homotopy equivalent to the Deligne-Mumford compactification. This work is joint with R. Penner.

Dynamics of Active Suspensions

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 28, 2011 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Christel HoheneggerMathematics, Univ. of Utah
One of the challenges in modeling the transport properties of complex fluids (e.g. many biofluids, polymer solutions, particle suspensions) is describing the interaction between the suspended micro-structure with the fluid itself. Here I will focus on understanding the dynamics of semi-dilute active suspensions, like swimming bacteria or artificial micro-swimmers modeled via a simple kinetic model neglecting chemical gradients and particle collisions. I will then present recent results on the linearized structure of such an active system near a state of uniformity and isotropy and on the onset of the instability as a function of the volume concentration of swimmers, both for a periodic domain. Finally, I will discuss the role of the domain geometry in driving the flow and the large-scale flow instabilities, as well as the appropriate boundary conditions.

Discrete Mathematical Biology Working Seminar

Series
Other Talks
Time
Monday, November 28, 2011 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 114
Speaker
Shel SwensonGeorgia Tech
A discussion of the paper "Using Motion Planning to Study RNA Folding Kinetics" by Tang et al (J Comp Biol, 2005).

On the stability of Prandtl boundary layers and the inviscid limit of the Navier-Stokes equations.

Series
PDE Seminar
Time
Tuesday, November 22, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Toan T. NguyenBrown University
In fluid dynamics, one of the most classical issues is to understand the dynamics of viscous fluid flows past solid bodies (e.g., aircrafts, ships, etc...), especially in the regime of very high Reynolds numbers (or small viscosity). Boundary layers are typically formed in a thin layer near the boundary. In this talk, I shall present various ill-posedness results on the classical Prandtl equation, and discuss the relevance of boundary-layer expansions and the vanishing viscosity limit problem of the Navier-Stokes equations. I will also discuss viscosity effects in destabilizing stable inviscid flows.

Tropical convexity, linear systems on metric graphs, and a generalized notion of reduced divisors

Series
Algebra Seminar
Time
Monday, November 21, 2011 - 16:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Ye LuoGeorgia Tech
Metric graphs arise naturally in tropical tropical geometry and Berkovich geometry. Recent efforts have extend conventional notion of divisors and linear systems on algebraic curves to finite graphs and metric graphs (tropical curves). Reduced divisors are introduced as an essential tool in proving graph-theoretic Riemann-Roch. In short, a q-reduced divisor is the unique divisor in a linear system with respect to a point q in the graph. In this talk, I will show how tropical convexity is related to linear systems on metric graphs, and define a canonical metric on the linear systems. In addition, I will introduce a generalized notion of reduced divisors, which are defined with respect to any effective divisor as in comparison a single point (effective divisor of degree one) in the conventional case.

Symmetric chain decomposition for cyclic quotients of Boolean algebras and relation to cyclic crystals

Series
Combinatorics Seminar
Time
Friday, November 18, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Patricia HershNorth Carolina State University, Raleigh, NC
The quotient of a Boolean algebra by a cyclic group is proven to have a symmetric chain decomposition. This generalizes earlier work of Griggs, Killian and Savage on the case of prime order, giving an explicit construction for any order, prime or composite. The combinatorial map specifying how to proceed downward in a symmetric chain is shown to be a natural cyclic analogue of Kashiwara's sl_2 lowering operator in the theory of crystal bases. The talk will include a survey of related past work on symmetric chain decomposition and unimodality by Greene-Kleitman, Griggs-Killian-Savage, Proctor, Stanley and others as well as a discussion of open questions that still remain. This is joint work with Anne Schilling.

Planar and Hamiltonian Cover Graphs

Series
Dissertation Defense
Time
Friday, November 18, 2011 - 13:00 for 2 hours
Location
Skiles 005
Speaker
Noah StreibSchool of Mathematics, Georgia Tech
This dissertation has two principal components: the dimension of posets with planar cover graphs, and the cartesian product of posets whose cover graphs have hamiltonian cycles that parse into symmetric chains. Posets of height two can have arbitrarily large dimension. In 1981, Kelly provided an infinite sequence of planar posets that shows that the dimension of planar posets can also be arbitrarily large. However, the height of the posets in this sequence increases with the dimension. In 2009, Felsner, Li, and Trotter conjectured that for each integer h \geq 2, there exists a least positive integer c_h so that if P is a poset having a planar cover graph (hence P is a planar poset as well) and the height of P is h, then the dimension of P is at most c_h. In the first principal component of this dissertation we prove this conjecture. We also give the best known lower bound for c_h, noting that this lower bound is far from the upper bound. In the second principal component, we consider posets with the Hamiltonian Cycle--Symmetric Chain Partition (HC-SCP) property. A poset of width w has this property if its cover graph has a Hamiltonian cycle which parses into w symmetric chains. This definition is motivated by a proof of Sperner's Theorem that uses symmetric chains, and was intended as a possible method of attack on the Middle Two Levels Conjecture. We show that the subset lattices have the HC-SCP property by showing that the class of posets with the strong HC-SCP property, a slight strengthening of the HC-SCP property, is closed under cartesian product with a two-element chain. Furthermore, we show that the cartesian product of any two posets from this class has the HC-SCP property.

Circuits in medial graphs and bipartite partial duals

Series
Graph Theory Seminar
Time
Thursday, November 17, 2011 - 12:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Iain MoffattUniversity of South Alabama
A classical result in graph theory states that, if G is a plane graph, then G is Eulerian if and only if its dual, G*, is bipartite. I will talk about an extension of this well-known result to partial duality. (Where, loosely speaking, a partial dual of an embedded graph G is a graph obtained by forming the dual with respect to only a subset of edges of G.) I will extend the above classical connection between bipartite and Eulerian plane graphs, by providing a necessary and sufficient condition for the partial dual of a plane graph to be Eulerian or bipartite. I will then go on to describe how the bipartite partial duals of a plane graph G are completely characterized by circuits in its medial graph G_m. This is joint work with Stephen Huggett.

Empirical likelihood and Extremes

Series
Dissertation Defense
Time
Wednesday, November 16, 2011 - 15:00 for 1.5 hours (actually 80 minutes)
Location
Skiles 171
Speaker
Yun GongSchool of Mathematics, Georgia Tech

Please Note: Advisor: Liang Peng

In 1988, Owen introduced empirical likelihood as a nonparametric method for constructing confidence intervals and regions. It is well known that empirical likelihood has several attractive advantages comparing to its competitors such as bootstrap: determining the shape of confidence regions automatically; straightforwardly incorporating side information expressed through constraints; being Bartlett correctable. In this talk, I will discuss some extensions of the empirical likelihood method to several interesting and important statistical inference situations including: the smoothed jackknife empirical likelihood method for the receiver operating characteristic (ROC) curve, the smoothed empirical likelihood method for the conditional Value-at-Risk with the volatility model being an ARCH/GARCH model and a nonparametric regression respectively. Then, I will propose a method for testing nested stochastic models with discrete and dependent observations.

Pages