Georgia Institute of Technology College of Sciences

We will discuss how to define two invariants of knots using sutured Heegaard Floer homology, contact structures and limiting processes. These invariants turn out to be a reformulation of the plus and minus versions of knot Heegaard Floer homology and thus give a``sutured interpretation'' of these invariants and point to a deep connection between Heegaard Floer theory and contact geometry. If time permits we will also discuss the possibility of defining invariants of non-compact manifolds and of contact structures on such manifolds.

Chip-firing on graphs is a simple process with suprising connections to various areas of mathematics. In recent years it has been recognized as a combinatorial language for describing linear equivalence of divisors on graphs and tropical curves. There are two distinct chip-firing games: the unconstrained chip-firing game of Baker and Norine and the Abelian sandpile model of Bak, Tang, and Weisenfled, which are related by a duality very close to Riemann-Roch theory. In this talk we introduce generalized chip-firing dynamics via open covers which provide a fine interpolation between these two previously studied models.

Volume preserving maps naturally arise in the study of many natural phenomena including incompressible fluid-flows, magnetic field-line flows, granular mixing, and celestial mechanics. Codimension one invariant tori play a fundamental role in the dynamics of these maps as they form boundaries to transport; orbits that begin on one side cannot cross to the other. In this talk I will present a Fourier-based, quasi-Newton scheme to compute the invariant tori of three-dimensional volume-preserving maps. I will further show how this method can be used to predict the perturbation threshold for their destruction and study the mechanics of their breakup.

I discuss "simple" dynamical systems on networks and examine how network structure affects dynamics of processes running on top of networks. I consider results based on "locally tree-like" and/or mean-field and pair approximations and examine when they seem to work well, what can cause them to fail, and when they seem to produce accurate results even though their hypotheses are violated fantastically. I'll also present a new model for multi-stage complex contagions--in which fanatics produce greater influence than mere followers--and examine dynamics on networks with hetergeneous correlations. (This talk discusses joint work with Davide Cellai, James Gleeson, Sergey Melnik, Peter Mucha, J-P Onnela, Felix Reed-Tsochas, and Jonathan Ward.)

Have you heard the urban legend that an experienced college recruiter can make an initial decision on whether or not to read your resume in less than six seconds? Would you like to see if your current resume can survive the six-second glance?Would you like to improve your chances of surviving the initial cut? Do you know what happens to your resume once you hand it to the recruiter? How do you craft a resume that competes with 100,000 other resumes? Dr. Matthew Clark has supported college recruiting efforts for a variety of large corporations and is a master at sorting resumes in six seconds or under. Join us August 28th, 2013 in Skiles 005 at noon for a discussion of how most industry companies handle resumes, what types of follow up activities are worth-while, and, how to improve your chances of having your resume pass the "six second glance".

We study the Maker-Breaker component game, played on the edge set of a regular graph. Given a graph G, the s-component (1:b) game is defined as follows: in every round Maker claims one free edge of G and Breaker claims b free edges. Maker wins this game if her graph contains a connected component of size at least s; otherwise, Breaker wins the game. For all values of Breaker's bias b, we determine whether Breaker wins (on any d-regular graph) or Maker wins (on almost every d-regular graph) and provide explicit winning strategies for both players. To this end, we prove an extension of a theorem by Gallai-Hasse-Roy-Vitaver about graph orientations without long directed simple paths. Joint work with Alon Naor.