Seminars and Colloquia by Series

Avoiding Many Monochromatic Constellations

Series
Combinatorics Seminar
Time
Friday, February 11, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Kevin CostelloSchool of Mathematics, Georgia Tech
We consider the question of coloring the first n integers with two colors in such a way as to avoid copies of a given arithmetic configuration (such as 3 term arithmetic progressions, or solutions to x+y=z+w). We know from results of Van der Waerden and others that avoiding such configurations completely is a hopeless task if n is sufficiently large, so instead we look at the question of finding colorings with comparatively few monochromatic copies of the configuration. At the very least, can we do significantly better than just closing our eyes and coloring randomly? I will discuss some partial answers, experimental results, and conjectured answers to these questions for certain configurations based on joint work with Steven Butler and Ron Graham.

Large deviations for Minkowski sums of heavy-tailed random compact sets

Series
Mathematical Finance/Financial Engineering Seminar
Time
Friday, February 11, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 002
Speaker
Gennady Samorodnitsky School of Operations Research and Information Engineering, Cornell University

Please Note: Hosted by Christian Houdre and Liang Peng

We prove large deviation results for Minkowski sums S_n of iid random compact sets, both convex and non-convex, where we assume that the summands have a regularly varying distribution and either finite or infinite expectation. The results confirm the heavy-tailed large deviation heuristics: "large'' values of the sum are essentially due to the "largest'' summand.

A Riemannian geometry look at contact geometry

Series
Geometry Topology Working Seminar
Time
Friday, February 11, 2011 - 14:00 for 2 hours
Location
Skiles 269
Speaker
John EtnyreSchool of Mathematics, Georgia Tech
This is part two of a lecture series investigating questions in contact geometry from the perspective of Riemannian geometry. Interesting questions in Riemannian geometry arising from contact geometry have a long and rich history, but there have been few applications of Riemannian geometry to contact topology. In these talks I will discuss basic connections between Riemannian and contact geometry and some applications of these connections. I will also discuss the "contact sphere theorem" that Rafal Komendarczyk, Patrick Massot and I recently proved as well as other results.

The minimum number of edges in color-critical graphs

Series
Graph Theory Seminar
Time
Thursday, February 10, 2011 - 12:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Chun-Hung LiuMath, GT
A graph is k-critical if it is not (k-1)-colorable but every proper subgraph is. In 1963, Gallai conjectured that every k-critical graph G of order n has at least (k-1)n/2 + (k-3)(n-k)/(2k-2) edges. The currently best known results were given by Krivelevich for k=4 and 5, and by Kostochka and Stiebitz for k>5. When k=4, Krivelevich's bound is 11n/7, and the bound in Gallai's conjecture is 5n/3 -2/3. Recently, Farzad and Molloy proved Gallai's conjecture for k=4 under the extra condition that the subgraph induced by veritces of degree three is connected. We will review the proof given by Krivelevich, and the proof given by Farzad and Molloy in the seminar.

Analysis of partial differential equations in non-smooth media

Series
Job Candidate Talk
Time
Thursday, February 10, 2011 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Svitlana MayborodaPurdue University
Despite its long history, the theory of ellipticpartial differential equations in non-smooth media is abundant with openproblems. We will discuss the main achievements in the theory, recentdevelopments, surprising paradoxes related to the behavior of solutions nearthe boundary, and some fundamental questions which still remain open.

The commutator approach to semiclassical inequalities

Series
Math Physics Seminar
Time
Wednesday, February 9, 2011 - 16:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Evans HarrellSoM Georgia Tech
I'll describe some connections between identities for commutators and boundson eigenvalues, including Stubbe's proof of classical Lieb-Thirringinequalities and other sharp Lieb-Thirring inequalities for different models(including Schrödinger operators with periodic potentials or on manifolds,and quantum graphs).

Stability of vortex and wave flows from bifurcation diagrams exploiting a variational argument

Series
Other Talks
Time
Wednesday, February 9, 2011 - 16:15 for 1 hour (actually 50 minutes)
Location
Howey W505
Speaker
Paolo Luzzatto-FegizMechanical & Aerospace Engineering, Cornell University
Steady fluid solutions can play a special role in characterizing the dynamics of a flow: stable states might be realized in practice, while unstable ones may act as attractors in the unsteady evolution. Unfortunately, determining stability is often a process substantially more laborious than computing steady flows; this is highlighted by the fact that, for several comparatively simple flows, stability properties have been the subject of protracted disagreement (see e.g. Dritschel et al. 2005, and references therein). In this talk, we build on some ideas of Lord Kelvin, who, over a century ago, proposed an energy-based stability argument for steady flows. In essence, Kelvin’s approach involves using the second variation of the energy to establish bounds on the growth of a perturbation. However, for numerically obtained fluid equilibria, computing the second variation of the energy explicitly is often not feasible. Whether Kelvin’s ideas could be implemented for general flows has been debated extensively (Saffman & Szeto, 1980; Dritschel, 1985; Saffman, 1992; Dritschel, 1995). We recently developed a stability approach, for families of steady flows, which constitutes a rigorous implementation of Kelvin’s argument. We build on ideas from bifurcation theory, and link turning points in a velocity-impulse diagram to exchanges of stability. We further introduce concepts from imperfection theory into these problems, enabling us to reveal hidden solution branches. Our approach detects exchanges of stability directly from families of steady flows, without resorting to more involved stability calculations. We consider several examples involving fundamental vortex and wave flows. For all flows studied, we obtain stability results in agreement with linear analysis, while additionally discovering new steady solutions, which exhibit lower symmetry. Paolo is a candidate for J Ford Fellowship at CNS. To view and/or participate in the CNS Webinar from wherever you are: evo.caltech.edu/evoNext/koala.jnlp?meeting=MeMMMu2M2iD2Di9D9nDv9e

Exotic Four Manifolds

Series
Geometry Topology Student Seminar
Time
Wednesday, February 9, 2011 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Bulent TosunGeorgia Tech
This will be a continuation of last week's talk on exotic four manifolds. We will recall the rational blow down operation and give a quick exotic example.

Hyperbolic polyhedra and the Jones polynomial

Series
Geometry Topology Seminar
Time
Monday, February 7, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Roland van der VeenUCBerkeley
For knots the hyperbolic geometry of the complement is known to be relatedto itsJones polynomial in various ways. We propose to study this relationship morecloselyby extending the Jones polynomial to graphs. For a planar graph we will showhow itsJones polynomial then gives rise to the hyperbolic volume of the polyhedronwhose1-skeleton is the graph. Joint with Francois Gueritaud and FrancoisCostantino.

Lecture series on the disjoint paths algorithm

Series
Graph Theory Seminar
Time
Monday, February 7, 2011 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 168
Speaker
Paul WollanGT, Math 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.

Pages