$L_p$ regular sparse hypergraphs: box norms

Abstract

We consider some variants of the Gowers box norms, introduced by Hatami, and show their relevance in the context of sparse hypergraphs. Our main results are the following. Firstly, we prove a generalized von Neumann theorem for $L_p$ graphons. Secondly, we give natural examples of pseudorandom families, that is, sparse weighted uniform hypergraphs which satisfy relative versions of the counting and removal lemmas.