Mcmaster

In 1923, Dulac published a proof of the claim that every real analytic vector field on the plane has only finitely many limit cycles (now known as Dulac's Problem). In the mid-1990s, Ilyashenko completed Dulac's proof; his completion rests on the construction of a quasianalytic class of functions. Unfortunately, this class has very few known closure properties. For various reasons I will explain, we are interested in constructing a larger quasianalytic class that is also a Hardy field. This can be achieved using Ilyashenko's idea of superexact asymptotic expansion.  (Joint work with Tobias Kaiser)

VC dimension and density are properties of a collection of sets which come from probability theory.  It was observed by Laskowski that there is a close tie between these notions and the model-theoretic property called NIP. This tie results in many examples of collections of sets that have finite VC dimension. In general, it is difficult to find upper bounds for the VC dimension, and known bounds are mostly very large. However, the VC density seems to be more accessible. In this talk, I will explain all of the above acronyms, and present a theorem which gives an upper bound (in some cases optimal) on the VC density of formulae in some examples of NIP theories. This represents joint work of myself with M. Aschenbrenner, A. Dolich, D. Macpherson and S.

Starchenko.