Independent sets in algebraic hypergraphs (Q2119362): Difference between revisions

Summary: In this paper we study hypergraphs definable in an algebraically closed field. Our goal is to show, in the spirit of the so-called transference principles in extremal combinatorics, that if a given algebraic hypergraph is ``dense'' in a certain sense, then a generic low-dimensional subset of its vertices induces a subhypergraph that is also ``dense''. (For technical reasons, we only consider low-dimensional subsets that are parameterized by rational functions.) Our proof approach is inspired by the hypergraph containers method, developed by \textit{J. Balogh} et al. [J. Am. Math. Soc. 28, No. 3, 669--709 (2015; Zbl 1310.05154)] and independently by \textit{D. Saxton} and \textit{A. Thomason} [Invent. Math. 201, No. 3, 925--992 (2015; Zbl 1320.05085)] (although adapting this method to the algebraic setting presents some unique challenges that do not occur when working with finite hypergraphs). Along the way, we establish a natural generalization of the classical dimension of fibers theorem in algebraic geometry, which is interesting in its own right.