Georgia Institute of Technology College of Sciences

The area was essentially originated by the general question: How many zeros of a random polynomials are real? Kac showed that the expected number of real zeros for a polynomial with i.i.d. Gaussian coefficients is logarithmic in terms of the degree. Later, it was found that most of zeros of random polynomials are asymptotically uniformly distributed near the unit circumference (with probability one) under mild assumptions on the coefficients. Thus two main directions of research are related to the almost sure limits of the zero counting measures, and to the quantitative results on the expected number of zeros in various sets. We give estimates of the expected discrepancy between the zero counting measure and the normalized arclength on the unit circle. Similar results are established for polynomials with random coefficients spanned by various bases, e.g., by orthogonal polynomials. We show almost sure convergence of the zero counting measures to the corresponding equilibrium measures for associated sets in the plane, and quantify this convergence. Random coefficients may be dependent and need not have identical distributions in our results.

In this talk, we will discuss a T1 theorem for band operators (operators with finitely many diagonals) in the setting of matrix A_2 weights. This work is motivated by interest in the currently open A_2 conjecture for matrix weights and generalizes a scalar-valued theorem due to Nazarov-Treil-Volberg, which played a key role in the proof of the scalar A_2 conjecture for dyadic shifts and related operators. This is joint work with Brett Wick.

In this talk I will present the notion of a \delta-packing for set systems of bounded primal shatter dimension (closely related to the notion of finite VC-dimension). The structure of \delta-packing, which has been studied by Dudley in 1978 and Haussler in 1995, emerges from empirical processes and is fundamental in theoretical computer science and in computational geometry in particular. Moreover, it has applications in geometric discrepancy, range searching, and epsilon-approximations, to name a few. I will discuss a variant of \delta-packings where all the sets have small cardinality, we call these structures "shallow packings", and then present an upper bound on their size under additional natural assumptions on the set system, which correspond to several geometric settings, among which is the case of points and halfspaces in d-dimensions.

I will discuss recent work of Bhargav Bhatt, myself and Shunsuke Takagi relating several open problems and generalizing work of Mustata and Srinivas. First: whether a smooth complex variety is ordinary after reduction to characteristic $p > 0$ for infinitely many $p$. Second: that multiplier ideals reduce to test ideals for infinitely many $p$ (regardless of coefficients). Finally, whether complex varieties with Du Bois singularities have $F$-injective singularities after reduction to infinitely many $p > 0$.