We show that a subset of of -dimension at most is well approximated by a union of atoms of a quadratic factor of complexity (denoting the complexities of the linear and quadratic part, respectively), where and are bounded by a constant depending only on and the desired level of approximation. This generalises a result of Alon, Fox and Zhao on the structure of sets of bounded -dimension, and is analogous to contemporaneous work of the authors arXiv:2111.01737 in the setting of 3-uniform hypergraphs. The main result originally appeared–albeit with a different proof–in a 2021 preprint arXiv:2111.01739, which has since been split into two: the present work, which focuses on higher arity NIP and develops a theory of local uniformity semi-norms of possibly independent interest, and its companion arXiv:2111.01739, which strengthens these results under a generalized notion of stability.

生成讲解博客的中文版本

生成AI智能校验的中文版本