Georgia Institute of Technology School of Mathematics | Georgia Institute of Technology | Atlanta, GA

Geometric mechanics describes Lagrangian and Hamiltonian mechanics geometrically, and information geometry formulates statistical estimation, inference, and machine learning in terms of geometry. A divergence function is an asymmetric distance between two probability densities that induces differential geometric structures and yields efficient machine learning algorithms that minimize the duality gap. The connection between information geometry and geometric mechanics will yield a unified treatment of machine learning and structure-preserving discretizations. In particular, the divergence function of information geometry can be viewed as a discrete Lagrangian, which is a generating function of a symplectic map, that arise in discrete variational mechanics. This identification allows the methods of backward error analysis to be applied, and the symplectic map generated by a divergence function can be associated with the exact time-$h$ flow map of a Hamiltonian system on the space of probability distributions.

Lorentzian polynomials link continuous convex analysis and discrete convex analysis via tropical geometry. The tropical connection is used to produce Lorentzian polynomials from discrete convex functions. Although no specific background beyond linear algebra and multivariable calculus will be needed to enjoy the presentation, I advertise the talk to people with interests in at least one of the following topics: graphs, convex bodies, stable polynomials, projective varieties, Potts model partition functions, tropicalizations, Schur polynomials, highest weight representations. Based on joint works with Petter Brändén, Christopher Eur, Jacob Matherne, Karola Mészáros, and Avery St. Dizier.

A sequence A of positive integers is r-Ramsey complete if for every r-coloring of A, every sufficiently large integer can be written as a sum of the elements of a monochromatic subsequence. Burr and Erdos proposed several open problems in 1985 on how sparse can an r-Ramsey complete sequence be and which polynomial sequences are r-Ramsey complete. Erdos later offered cash prizes for two of these problems. We prove a result which solves the problems of Burr and Erdos on Ramsey complete sequences. The proof uses tools from probability, combinatorics, and number theory. 

Joint work with David Conlon.

This is a talk about 3-manifolds and knots. We will begin by reviewing some basic constructions and motivations in low-dimensional topology, and will then introduce the homology cobordism group, the group of 3-manifolds with the same homology as the 3-dimensional sphere up to a reasonable notion of equivalence. We will discuss what is known about the structure of this group and its connection to higher dimensional topology. We will then discuss some existing invariants of the homology cobordism group coming from gauge theory and symplectic geometry, particularly Floer theory. Finally, we will introduce a new invariant of homology cobordism coming from an equivariant version of the computationally-friendly Floer-theoretic 3-manifold invariant Heegaard Floer homology, and use it to construct a new filtration on the homology cobordism group and derive some structural applications. Parts of this talk are joint work with C. Manolescu and I. Zemke; more recent parts of this talk are joint work with J. Hom and T. Lidman.