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

Finding and understanding patterns in data sets is of significant importance in many applications. One example of a simple pattern is the distance between data points, which can be thought of as a 2-point configuration. Two classic questions, the Erdos distinct distance problem, which asks about the least number of distinct distances determined by N points in the plane, and its continuous analog, the Falconer distance problem, explore that simple pattern. Questions similar to the Erdos distinct distance problem and

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.

A Gaussian stationary sequence is a random function f: Z --> R, for which any vector (f(x_1), ..., f(x_n)) has a centered multi-normal distribution and whose distribution is invariant to shifts. Persistence is the event of such a random function to remain positive on a long interval [0,N]. Estimating the probability of this event has important implications in engineering , physics, and probability. However, though active efforts to understand persistence were made in the last 50 years, until recently, only specific examples and very general bounds

We study regularity properties of weak solutions of the homogeneous Boltzmann equation. While under the so called Grad cutoff assumption the homogeneous Boltzmann equation is known to propagate smoothness and singularities, it has long been suspected that the non-cutoff Boltzmann operator has similar coercivity properties as a fractional Laplace operator. This has led to the hope that the homogenous Boltzmann equation enjoys similar smoothing properties as the heat equation with a fractional Laplacian.

We consider the two-dimensional BCS functional with a radial pair interaction. We show that the translational symmetry is not broken in a certain temperature interval below the critical temperature. For this purpose, we first introduce the full BCS functional and the translation invariant BCS functional. Our main result states that theminimizers of the full BCS functional coincide with the minimizers of the translation invariant BCS functional for temperatures in the aforementioned interval.

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.

We impose standard $T1$-type assumptions on a Calderón-Zygmund operator $T$, and deduce that for bounded compactly supported functions $f,g$ there is a sparse bilinear form $\Lambda$ so that $$ |\langle T f, g \rangle | \lesssim \Lambda (f,g). $$ The proof is short and elementary. The sparse bound quickly implies all the standard mapping properties of a Calderón-Zygmund on a (weighted) $L^p$ space.

The Linear Independence of Time-Frequency Translates Conjecture, also known as the HRT conjecture, states that any finite set of time-frequency translates of a given $L^2$ function must be linearly independent. This conjecture, which was first stated in print in 1996, remains open today. We will discuss this conjecture, its relation to the Zero Divisor Conjecture in abstract algebra, and the (frustratingly few) partial results that are currently available.

We show that the multiwavelets, introduced by Alpert in 1993, are related to type I Legendre-Angelesco multiple orthogonal polynomials. We give explicit formulas for these Legendre-Angelesco polynomials and for the Alpert multiwavelets. The multiresolution analysis can be done entirely using Legendre polynomials, and we give an algorithm, using Cholesky factorization, to compute the multiwavelets and a method, using the Jacobi matrix for Legendre polynomials, to compute the matrices in the scaling relation for any size of the multiplicity of the