Seminars and Colloquia by Series

Parallel Graph Algorithms

Series
ACO Student Seminar
Time
Friday, September 23, 2016 - 13:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Richard PengCollege of Computing, Georgia Tech
Parallel algorithms study ways of speeding up sequential algorithms by splitting work onto multiple processors. Theoretical studies of parallel algorithms often focus on performing a small number of operations, but assume more generous models of communication. Recent progresses led to parallel algorithms for many graph optimization problems that have proven to be difficult to parallelize. In this talk I will survey routines at the core of these results: low diameter decompositions, random sampling, and iterative methods.

Penner's conjecture

Series
Geometry Topology Student Seminar
Time
Wednesday, September 21, 2016 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Balazs StrennerGeorgia Tech
In 1988, Penner conjectured that all pseudo-Anosov mapping classes arise up to finite power from a construction named after him. This conjecture was known to be true on some simple surfaces, including the torus, but has otherwise remained open. I will sketch the proof (joint work with Hyunshik Shin) that the conjecture is false for most surfaces.

Inequalities for eigenvalues of sums of self-adjoint operators and related intersection problems (Part I)

Series
Analysis Seminar
Time
Wednesday, September 21, 2016 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Wing LiGeorgia Tech
Consider Hermitian matrices A, B, C on an n-dimensional Hilbert space such that C=A+B. Let a={a_1,a_2,...,a_n}, b={b_1, b_2,...,b_n}, and c={c_1, c_2,...,c_n} be sequences of eigenvalues of A, B, and C counting multiplicity, arranged in decreasing order. Such a triple of real numbers (a,b,c) that satisfies the so-called Horn inequalities, describes the eigenvalues of the sum of n by n Hermitian matrices. The Horn inequalities is a set of inequalities conjectured by A. Horn in 1960 and later proved by the work of Klyachko and Knutson-Tao. In these two talks, I will start by discussing some of the history of Horn's conjecture and then move on to its more recent developments. We will show that these inequalities are also valid for selfadjoint elements in a finite factor, for types of torsion modules over division rings, and for singular values for products of matrices, and how additional information can be obtained whenever a Horn inequality saturates. The major difficulty in our argument is the proof that certain generalized Schubert cells have nonempty intersection. In the finite dimensional case, it follows from the classical intersection theory. However, there is no readily available intersection theory for von Neumann algebras. Our argument requires a good understanding of the combinatorial structure of honeycombs, and produces an actual element in the intersection algorithmically, and it seems to be new even in finite dimensions. If time permits, we will also discuss some of the intricate combinatorics involved here. In addition, some recent work and open questions will also be presented.

The knot concordance group

Series
Research Horizons Seminar
Time
Wednesday, September 21, 2016 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Prof. Jennifer HomSchool of Mathematics, Georgia Institute of Technology

Please Note: Food and Drinks will be provided before the seminar.

A knot is a smooth embedding of S^1 into S^3 or R^3. There is a natural way to "add" two knots, called the connected sum. Under this operation, the set of knots forms a monoid. We will quotient by an equivalence relation called concordance to obtain a group, and discuss what is known about the structure of this group.

Geometric Small Cancellation

Series
Geometry Topology Working Seminar
Time
Wednesday, September 21, 2016 - 10:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Justin LanierGeorgia Tech
In this lecture series, held jointly (via video conference) with the University of Buffalo and the University of Arkansas, we aim to understand the lecture notes by Vincent Guirardel on geometric small cancellation. The lecture notes can be found here: https://perso.univ-rennes1.fr/vincent.guirardel/papiers/lecture_notes_pcmi.pdf This week we will compete the first of two steps in proving the small cancellation theorem (Lecture 3).

A min-max formula for Lipschitz operators that satisfy the global comparison principle.

Series
PDE Seminar
Time
Tuesday, September 20, 2016 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Professor Russell SchwabMichigan State University
We investigate Lipschitz maps, I, mapping $C^2(D) \to C(D)$, where $D$ is an appropriate domain. The global comparison principle (GCP) simply states that whenever two functions are ordered in D and touch at a point, i.e. $u(x)\leq v(x)$ for all $x$ and $u(z)=v(z)$ for some $z \in D$, then also the mapping I has the same order, i.e. $I(u,z)\leq I(v,z)$. It has been known since the 1960’s, by Courr\`{e}ge, that if I is a linear mapping with the GCP, then I must be represented as a linear drift-jump-diffusion operator that may have both local and integro-differential parts. It has also long been known and utilized that when I is both local and Lipschitz it will be a min-min over linear and local drift-diffusion operators, with zero nonlocal part. In this talk we discuss some recent work that bridges the gap between these situations to cover the nonlinear and nonlocal setting for the map, I. These results open up the possibility to study Dirichlet-to-Neumann mappings for fully nonlinear equations as integro-differential operators on the boundary. This is joint work with Nestor Guillen.

The second law of thermodynamics /// Statistical mechanics.

Series
Non-Equilibrium Statistical Mechanics Reading Group
Time
Monday, September 19, 2016 - 16:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Rafael de la LlaveSchool of Mathematics, Georgia Tech
We will present the classical formulations (Gibbs, Maxwell, etc.) of the second law of thermodynamics and present the basics of the equilibrium statistical mechanics. The results are all classic and the presentation will be elementary, but we will try to point out some of the more subtle mathematical questions. The main goal of the lectures is to lay the groundwork to proceed to read "J. Dorfman: An introduction to chaos and non-equilibrium statistical mechanics". There will be cookies and some (sugar free) drinks.

Fox-Neuwirth cells, quantum shuffle algebras, and Malle’s conjecture for function fields

Series
Geometry Topology Seminar
Time
Monday, September 19, 2016 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Craig WesterlandUniversity of Minnesota
I will describe new techniques for computing the homology of braid groups with coefficients in certain exponential coefficient systems. An unexpected side of this story (at least to me) is a connection with the cohomology of certain braided Hopf algebras — quantum shuffle algebras and Nichols algebras — which are central to the classification of pointed Hopf algebras and quantum groups. We can apply these tools to get a bound on the growth of the cohomology of Hurwitz moduli spaces of branched covers of the plane in certain cases. This yields a weak form of Malle’s conjecture on the distribution of fields with prescribed Galois group in the function field setting. This is joint work with Jordan Ellenberg and TriThang Tran.

On the isotypic decomposition of cohomology modules of symmetric semi-algebraic sets

Series
Algebra Seminar
Time
Friday, September 16, 2016 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Saugata BasuPurdue
Real sub-varieties and more generally semi-algebraic subsets of $\mathbb{R}^n$ that are stable under the action of the symmetric group on $n$ elements acting on $\mathbb{R}^n$ by permuting coordinates, are expected to be topologically better behaved than arbitrary semi-algebraic sets. In this talk I will quantify this statement by showing polynomial upper bounds on the multiplicities of the irreducible $\mathfrak{S}_n$-representations that appear in the rational cohomology groups of such sets. I will also discuss some algorithmic results on the complexity of computing the equivariant Betti numbers of such sets and sketch some possible connectios with the recently developed theory of FI-modules. (Joint work with Cordian Riener).

A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems

Series
ACO Student Seminar
Time
Friday, September 16, 2016 - 13:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Sarah CannonGeorgia Tech
I will present work on a new application of Markov chains to distributed computing. Motivated by programmable matter and the behavior of biological distributed systems such as ant colonies, the geometric amoebot model abstracts these processes as self-organizing particle systems where particles with limited computational power move on the triangular lattice. Previous algorithms developed in this setting have relied heavily on leader election, tree structures that are not robust to failures, and persistent memory. We developed a distributed algorithm for the compression problem, where all particles want to gather together as tightly as possible, that is based on a Markov chain and is simple, robust, and oblivious. Tools from Markov chain analysis enable rigorous proofs about its behavior, and we show compression will occur with high probability. This joint work with Joshua J. Daymude, Dana Randall, and Andrea Richa appeared at PODC 2016. I will also present some more recent extensions of this approach to other problems, which is joint work with Marta Andres Arroyo as well.

Pages