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

Multicomponent reactive flows arise in many practical applicationssuch as combustion, atmospheric modelling, astrophysics, chemicalreactions, mathematical biology etc. The objective of this work isto develop a rigorous mathematical theory based on the principles ofcontinuum mechanics. Results on existence, stability, asymptotics as wellas singular limits will be discussed.

Lovasz Local Lemma (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small compared to the number of events that depend on it. It is often used in combination with the probabilistic method for non-constructive existence proofs. A prominent application of LLL is to k-CNF formulas, where LLL implies that, if every clause in the formula shares variables with at most d \le 2^k/e other clauses then such a formula has a satisfying assignment. Recently, a randomized algorithm to efficiently construct a satisfying assignment was given by Moser. Subsequently Moser and Tardos gave a randomized algorithm to construct the structures guaranteed by the LLL in a very general algorithmic framework. We will address the main problem left open by Moser and Tardos of derandomizing their algorithm efficiently when the number of other events that any bad event depends on is possibly unbounded. An interesting special case of the open problem is the k-CNF problem when k = \omega(1), that is, when k is more than a constant.

The McK--V system is a non--linear diffusion equation with a non--local non--linearity provided by convolution.  Recently popular in a variety of applications, it enjoys an ancient heritage as a basis for understanding equilibrium and near equilibrium fluids.  The model is discussed in finite volume where, on the basis of the physical considerations, the correct scaling (for the model itself) is identified.  For dimension two and above and in large volume, the phase structure of the model is completely elucidated in (somewhat disturbing) contrast to dynamical results.  This seminar represents joint work with V. Panferov.

We will discuss the classic theorem of Walter Schnyder: a graph G is planar if and only if the dimension of its incidence poset is at most 3. This result has been extended by Brightwell and Trotter to show that the dimension of the vertex-edge-face poset of a planar 3-connected graph is 4 and the removal of any vertex (or by duality, any face) reduces the dimension to 3. Recently, this result and its extension to planar multigraphs was key to resolving the question of the dimension of the adjacency poset of a planar bipartite graph. It also serves to motivate questions about the dimension of posets with planar cover graphs.