English

Definable regularity lemmas for NIP hypergraphs

Logic 2021-03-11 v4 Combinatorics

Abstract

We present a systematic study of the regularity phenomena for NIP hypergraphs and connections to the theory of (locally) generically stable measures, providing a model-theoretic hypergraph version of the results from [L. Lov\'asz, B. Szegedy, "Regularity partitions and the topology of graphons", An irregular mind, Springer Berlin Heidelberg, 2010, 415-446]. Besides, we revise the two extremal cases of regularity for stable and distal hypergraphs, improving and generalizing the results from [A. Chernikov, S. Starchenko, "Regularity lemma for distal structures", J. Eur. Math. Soc. 20 (2018), 2437-2466] and [M. Malliaris, S. Shelah, "Regularity lemmas for stable graphs", Transactions of the American Mathematical Society, 366.3, 2014, 1551-1585]. Finally, we consider a related question of the existence of large (approximately) homogeneous definable subsets of NIP hypergraphs and provide some positive results and counterexamples.

Keywords

Cite

@article{arxiv.1607.07701,
  title  = {Definable regularity lemmas for NIP hypergraphs},
  author = {Artem Chernikov and Sergei Starchenko},
  journal= {arXiv preprint arXiv:1607.07701},
  year   = {2021}
}

Comments

v4: 30 pages; "Related work" section was updated; accepted to the Quarterly Journal of Mathematics

R2 v1 2026-06-22T15:04:31.197Z