The structure of subsets of Fpn of bounded VC2-dimension

Abstract

We show that a subset of Fpn of VC2-dimension at most k is well approximated by a union of atoms of a quadratic factor of complexity (,q) (denoting the complexities of the linear and quadratic part, respectively), where and q are bounded by a constant depending only on k and the desired level of approximation. This generalises a result of Alon, Fox and Zhao on the structure of sets of bounded VC-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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…