Georgia Institute of Technology College of Sciences

They may flow like fluids but under constraints of mechanical energies from their crystal aspects. As a result, they exhibit very rich phenomena that grant them tremendous applications in modern technology. Based on works of Oseen, Z\"ocher, Frank and others, a continuum theory (not most general but satisfactory to a great extent) for liquid-crystals was formulated by Ericksen and Leslie in 1960s. We will first give a brief introduction to this classical theory and then focus on various important special settings in both static and dynamic cases. These special flows are rather simple for classical fluids but are quite nonlinear for liquid-crystals. We are able to apply abstract theory of nonlinear dynamical systems upon revealing specific structures of the problems at hands.

I plan to discuss a method for defining Heegaard Floer invariants for 3-manifolds. The construction is inspired by contact geometry and has several interesting immediate applications to the study of tight contact structures on noncompact 3-manifolds. In this talk, I'll focus on one basic examples and indicate how one defines a contact invariant which can be used to give an alternate proof of James Tripp's classification of tight, minimally twisting contact structures on the open solid torus. This is joint work with John B. Etnyre and Rumen Zarev.

I will discuss how the idea of coupling at time infinity is equivalent to unique ergodicity of a markov process. In general, the coupling will be a kind of "asymptotic Wasserstein" coupling. I will draw examples from SDEs with memory and SPDEs. The fact that both are infinite dimensional markov processes is no coincidence.

First-Fit is an online algorithm that partitions the elements of a poset into chains. When presented with a new element x, First-Fit adds x to the first chain whose elements are all comparable to x. In 2004, Pemmaraju, Raman, and Varadarajan introduced the Column Construction Method to prove that when P is an interval order of width w, First-Fit partitions P into at most 10w chains. This bound was subsequently improved to 8w by Brightwell, Kierstead, and Trotter, and independently by Narayanaswamy and Babu. The poset r+s is the disjoint union of a chain of size r and a chain of size s. A poset is an interval order if and only if it does not contain 2+2 as an induced subposet. Bosek, Krawczyk, and Szczypka proved that if P is an (r+r)-free poset of width w, then First-Fit partitions P into at most 3rw^2 chains and asked whether the bound can be improved from O(w^2) to O(w). We answer this question in the affirmative. By generalizing the Column Construction Method, we show that if P is an (r+s)-free poset of width w, then First-Fit partitions P into at most 8(r-1)(s-1)w chains. This is joint work with Gwena\"el Joret.