Georgia Institute of Technology College of Sciences

A well-known elementary linear algebra fact says that any linear independent set of vectors in a finite-dimensional vector space cannot have more elements than any spanning set. One way to obtain an analog of this result in the infinite dimensional setting is by replacing the comparison of cardinalities with a more suitable concept - which is the concept of densities. Basically one needs to compare the cardinalities locally everywhere and then take the appropriate limits. We provide a rigorous way to do this and obtain a universal density theorem that generalizes many classical density results. I will also discuss the connection between this result and the uncertainty principle in harmonic analysis.

It was shown by Keith Ball that the maximal section of an n-dimensional cube is \sqrt{2}. We show the analogous sharp bound for a maximal marginal of a product measure with bounded density. We also show an optimal bound for all k-codimensional marginals in this setting, conjectured by Rudelson and Vershynin. This bound yields a sharp small ball inequality for the length of a projection of a random vector. This talk is based on the joint work with G. Paouris and P. Pivovarov.

In this talk we will discuss several ways to construct new convex bodies out of old ones. We will start by defining various methods of "averaging" convex bodies, both old and new. We will explain the relationships between the various definitions and their connections to basic conjectures in convex geometry. We will then discuss the power operation, and explain for example why every convex body has a square root, but not every convex body has a square. If time permits, we will briefly discuss more complicated constructions such as logarithms. The talk is based on joint work with Vitali Milman.

For a compact subset $A$ of $R^n$ , let $A(k)$ be the Minkowski sum of $k$ copies of $A$, scaled by $1/k$. It is well known that $A(k)$ approaches the convex hull of $A$ in Hausdorff distance as $k$ goes to infinity. A few years ago, Bobkov, Madiman and Wang conjectured that the volume of $A(k)$ is non-decreasing in $k$, or in other words, that when the volume deficit between the convex hull of $A$ and $A(k)$ goes to $0$, it actually does so monotonically. While this conjecture holds true in dimension $1$, we show that it fails in dimension $12$ or greater. Then we consider whether one can have monotonicity of convergence of $A(k)$ when its non-convexity is measured in alternate ways. Our main positive result is that Schneider’s index of non-convexity of $A(k)$ converges monotonically to $0$ as $k$ increases; even the convergence does not seem to have been known before. We also obtain some results for the Hausdorff distance to the convex hull, along the way clarifying various properties of these notions of non-convexity that may be of independent interest.Joint work with Mokshay Madiman, Matthieu Fradelizi and Arnaud Marsiglietti.