Georgia Institute of Technology College of Sciences

It is an interesting well known fact that the relative entropy of the marginals of a density with respect to the Gaussian measure on Euclidean space satisfies a simple subadditivity property. Surprisingly enough, when one tries to achieve a similar result on the N-sphere a factor of 2 appears in the right hand side of the inequality (a result due to Carlen, Lieb and Loss), and this factor is sharp. Besides a deviation from the simple ``equivalence of ensembles principle'' in equilibrium Statistical Mechanics, this entropic inequality on the sphere has interesting ramifications in other fields, such as Kinetic Theory.In this talk we will present conditions on a density function on the sphere, under which we can get an ``almost'' subaditivity property; i.e. the factor 2 can be replaced with a factor that tends to 1 as the dimension of the sphere tends to infinity. The main tools for proving this result is an entropy conserving extension of the density from the sphere to Euclidean space together with a comparison of appropriate transportation distances such as the entropy, Fisher information and Wasserstein distance between the marginals of the original density and that of the extension. Time permitting, we will give an example that arises naturally in the investigation of the Kac Model.

Robertson and Seymour proved that graphs are well-quasi-ordered by the minor relation and the weak immersion relation. In other words, given infinitely many graphs, one graph contains another as a minor (or a weak immersion, respectively). Unlike the relation of minor and weak immersion, the topological minor relation does not well-quasi-order graphs in general. However, Robertson conjectured in the late 1980s that for every positive integer k, the topological minor relation well-quasi-orders graphs that do not contain a topological minor isomorphic to the path of length k with each edge duplicated. We will sketch the idea of our recent proof of this conjecture. In addition, we will give a structure theorem for excluding a fixed graph as a topological minor. Such structure theorems were previously obtained by Grohe and Marx and by Dvorak, but we push one of the bounds in their theorems to the optimal value. This improvement is needed for our proof of Robertson's conjecture. This work is joint with Robin Thomas.