Logic Seminar
Artem Chernikov
UCLA
Combinatorial properties of generically stable measures.
Abstract: We discuss combinatorial properties of generically stable Keisler measures in NIP theories, concentrating on the improved regularity lemmas for definable (hyper-)graphs in this context.
We give a model-theoretic version of the Lovasz-Szegedy result, generalizing the distal and the stable cases.
This questions are closely related to the existence of "large" homogeneous subsets (in various senses), and we give some partial results and counterexamples, in the o-minimal case and in the p-adics.
Joint work with Sergei Starchenko.
Tuesday April 26, 2016 at 4:00 PM in SEO 427