Seminars and Colloquia by Series

Galois groups of Schubert problems

Series
School of Mathematics Colloquium
Time
Thursday, April 5, 2012 - 11:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Frank SottileTexas A&M
Building on work of Jordan from 1870, in 1979 Harris showed that a geometric monodromy group associated to a problem in enumerative geometry is equal to the Galois group of an associated field extension. Vakil gave a geometric-combinatorial criterion that implies a Galois group contains the alternating group. With Brooks and Martin del Campo, we used Vakil's criterion to show that all Schubert problems involving lines have at least alternating Galois group. My talk will describe this background and sketch a current project to systematically determine Galois groups of all Schubert problems of moderate size on all small classical flag manifolds, investigating at least several million problems. This will use supercomputers employing several overlapping methods, including combinatorial criteria, symbolic computation, and numerical homotopy continuation, and require the development of new algorithms and software.

Two applications of Riemannian geometry: Thermal stresses in solid mechanics and density preserving maps in machine learning.

Series
Research Horizons Seminar
Time
Wednesday, April 4, 2012 - 12:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Arkadaş ÖzakınGeorgia Tech Research Institute
I will present two "real life" applications of Riemannian geometry,one in the field of continuum mechanics, another in the field ofmachine learning (nonlinear dimensionality reduction). I will providequick introductions in order to make the talk accessible to anaudience with no background in either field.

Statistical Multiscale Analysis: From Signal Detection to Nanoscale Photonic Imaging

Series
Stochastics Seminar
Time
Tuesday, April 3, 2012 - 16:05 for 1 hour (actually 50 minutes)
Location
Skyles 006
Speaker
Axel MunkInstitut für Mathematische Stochastik Georg-August-Universität Göttingen
In this talk we will discuss a general concept of statistical multiscale analysis in the context of signal detection and imaging. This provides a large class of fully data driven regularisation methods which can be viewed as a multiscale generalization of the Dantzig selector. We address computational issues as well as the required extreme value theory of the multiscale statistics. Two major example include change point regression and locally adaptive total variation image regularization for deconvolution problems. Our method is applied to problems from ion channel recordings and nanoscale biophotonic cell microscopy.

A discontinuous Galerkin method for Vlasov-like systems

Series
PDE Seminar
Time
Tuesday, April 3, 2012 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Phil MorrisonUniversity of Texas at Austin
This talk will be an amalgamation of aspects of scientific computing - development, verification, and interpretation - with application to the Vlasov-Poisson (VP) system, an important nonlinear partial differential equation containing the essential difficulties of collisionless kinetic theories. I will describe our development of a discontinuous Galerkin (DG) algorithm, its verification via convergence studies and comparison to known Vlasov results, and our interpretation of computational results in terms of dynamical systems ideas. The DG method was invented for solving a neutron transport model, successfully adapted to fluid motion including shock propagation, applied to the Boltzmann equation, and developed in the general context of conservation laws, and elliptic and parabolic equations. Our development for the VP system required the simultaneous approximation of the hyperbolic Vlasov equation with the elliptic Poisson equation, which created new challenges. I will briefy discuss advantages of the method and describe our error estimates and recurrence calculations for polynomial bases. Then, I will show results from a collection of benchmark computations of electron plasma dynamics, including i) convergence studies of high resolution linear and nonlinear Landau damping with a comparison to theoretical parameter dependencies ii) the nonlinear two-stream instability integrated out to (weak) saturation into an apparently stable equilibrium (BGK) state with detailed modeling of this state, and iii) an electric field driven (dynamically accessible) example that appears to saturate into various periodic solutions. I will interpret such final states, in analogy to finite-dimensional Hamiltonian theory, as Moser-Weinstein periodic orbits, and suggest a possible variational path for proof of their existence. Finally, I will comment briefly on recent progress on extensions to the Maxwell-Vlasov system, including estimates and computational results.

Real solving and certification

Series
Algebra Seminar
Time
Tuesday, April 3, 2012 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Jonathan HauensteinTexas A&M
In many applications in engineering and physics, one is interested in computing real solutions to systems of equations. This talk will explore numerical approaches for approximating solutions to systems of polynomial and polynomial-exponential equations. We will then discuss using certification methods based on Smale's alpha-theory to rigorously determine if the corresponding solutions are real. Examples from kinematics, electrical engineering, and string theory will be used to demonstrate the ideas.

A Computational Approach to Understanding Cardiac Arrhythmias

Series
Applied and Computational Mathematics Seminar
Time
Monday, April 2, 2012 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Elizabeth CherrySchool of Mathematical Sciences, Rochester Institute of Technology
The heart is an excitable system in which electrical waves normally propagate in a coordinated manner to produce an effective mechanical contraction. Rapid pacing can lead to the development of alternans, a period-doubling bifurcation in electrical response in which successive beats have long and short responses despite a constant pacing period. Alternans can develop into higher-order rhythms as well as spatiotemporally complex patterns that reflect large regions of dispersion in electrical response. These states disrupt synchrony and compromise the heart's mechanical function; indeed, alternans has been observed clinically as a precursor to dangerous arrhythmias, including ventricular fibrillation. In this talk, we will show experimental examples of alternans, describe how alternans develops using a mathematical and computational approach, and discuss the nonlinear dynamics of several possible mechanisms for alternans as well as the conditions under which they are likely to be important in initiating dangerous cardiac arrhythmias.

Berge duals and universally tight contact structures

Series
Geometry Topology Seminar
Time
Monday, April 2, 2012 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Chris CornwellDuke University
Berge has a construction that produces knots in S^3 that admit a lens space surgery. Conjecturally, his construction produces all such knots. This talk will consider knots that have such a surgery, and some of their contact geometric properties. In particular, knots in S^3 with a lens space surgery are fibered, and they all support the tight contact structure on S^3. From recent work of Hedden and Plamenevskaya, we also know that the dual to a lens space surgery on such a knot supports a tight contact structure on the resulting lens space. We consider the knots that are dual to Berge's knots, and we investigate whether the tight contact structure they support is a universally tight structure. Our results indicate a relationship between supporting this universally tight structure and being dual to a torus knot.

Discrete Mathematical Biology Working Seminar

Series
Other Talks
Time
Monday, April 2, 2012 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 114
Speaker
Emily RogersSchool of Mathematics, Georgia Tech
A discussion of the papers "Accurate SHAPE-directed RNA structure determination" by Deigan et al (2008) and "SHAPE-directed RNA secondary structure prediction" by Low and Weeks (2010).

Plane fields on 3-manifolds I

Series
Geometry Topology Working Seminar
Time
Friday, March 30, 2012 - 14:00 for 2 hours
Location
Skiles 006
Speaker
John EtnyreGa Tech

Please Note: Note this is a 2 hour talk

In this series of talks I will discuss various special plane fields on 3-manifold. Specifically we will consider folaitions and contact structures and the relationship between them. We will begin by sketching a proof of Eliashberg and Thurston's famous theorem from the 1990's that says any sufficiently smooth foliation can be approximated by a contact structure. In the remaining talks I will discuss ongoing research that sharpens our understanding of the relation between foliations and contact structures.

Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies

Series
ACO Student Seminar
Time
Friday, March 30, 2012 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Ning TanSchool of Math, Georgia Tech
In a celebrated result, Raghavendra [Rag08] showed that, assuming Unique Game Conjecture, every Max-CSP problem has a sharp approximation threshold that matches the integrality gap of a natural SDP relaxation. Raghavendra and Steurer [RS09] also gave a simple and unified framework for optimally approximating all the Max-CSPs.In this work, we consider the problem of approximating CSPs with global cardinality constraints. For example, Max-Cut is a boolean CSP where the input is a graph $G = (V,E)$ and the goal is to find a cut $S \cup \bar S = V$ that maximizes the number of crossing edges, $|E(S,\bar S)|$. The Max-Bisection problem is a variant of Max-Cut with an additional global constraint that each side of the cut has exactly half the vertices, i.e., $|S| = |V|/2$. Several other natural optimization problems like Small Set Expansion, Min Bisection and approximating Graph Expansion can be formulated as CSPs with global constraints.In this talk, I will introduce a general approach towards approximating CSPs with global constraints using SDP hierarchies. To demonstrate the approach, I will present an improved algorithm for Max-Bisection problem that achieves the following:- Given an instance of Max-Bisection with value $1-\epsilon$, the algorithm finds a bisection with value at least $1-O(\sqrt{\epsilon})$ with running time $O(n^{poly(1/\eps)})$. This approximation is near-optimal (up to constant factors in $O()$) under the Unique Games Conjecture.- Using computer-assisted proof, we show that the same algorithm also achieves a 0.85-approximation for Max-Bisection, improving on the previous bound of 0.70 (note that it is UGC-hard to approximate better than 0.878 factor). As an attempt to prove matching hardness result, we show a generic conversion from SDP integrality gap to dictatorship test for any CSP with global cardinality constraints. The talk is based on joint work with Prasad Raghavendra.

Pages