Georgia Institute of Technology College of Sciences

One of the outstanding open problems of statistical mechanics is about the hard-core model which is a popular topic in mathematical physics and has applications in a number of other disciplines. Namely, do non-overlapping hard disks of the same diameter in the plane admit a unique Gibbs measure at high density? It seems natural to approach this question by requiring the centers to lie in a fine lattice; equivalently, we may fix the lattice, but let the Euclidean diameter D of the hard disks tend to infinity. In two dimensions, it can be a unit triangular lattice A_2 or a unit square lattice Z^2. The randomness is generated by Gibbs/DLR measures with a large value of fugacity which corresponds to a high density. We analyze the structure of high-density hard-core Gibbs measures via the Pirogov-Sinai theory. The first step is to identify periodic ground states, i.e., maximal-density disk configurations which cannot be locally `improved'. A key finding is that only certain `dominant' ground states, which we determine, generate nearby Gibbs measures. Another important ingredient is the Peierls bound separating ground states from other admissible configurations. In particular, number-theoretic properties of the exclusion diameter D turn out to be important. Answers are provided in terms of Eisenstein primes for A_2 and norm equations in the cyclotomic ring Z[ζ] for Z^2, where ζ is the primitive 12th root of unity. Unlike most models in statistical physics, we find non-universality: the number of high-density hard-core Gibbs measures grows indefinitely with D but
non-monotonically. In Z^2 we also analyze the phenomenon of 'sliding' and show it is rare.
This is a joint work with A. Mazel and Y. Suhov.

Starting from mathematical approaches for image processing, we will discuss different models, analytic aspects of them, and numerical challenges.  If time permits we will consider numerical applications to data understanding. A few other applications may be presented.

I will continue to describe deterministic algorithms for approximately counting common bases of matroids within an exponential factor. This is based on AOVI and previous works of AO.

 One strategy for developing a proof of a claimed theorem is to start by understanding what a counter-example should look like.  In this talk, we will discuss a few recent results in harmonic analysis that utilize a quantitative version of this approach.  A key step is the solution of an inverse problem with the following flavor.  Let $T:X \to Y$ be a bounded linear operator and let $0 < a \leq \|T\|$.  What can we say about those functions $f \in X$ obeying the reverse inequality $\|Tf\|_Y \geq a\|f\|_X$?