Weak hypergraph regularity and applications to geometric Ramsey theory
Abstract
Let =1×…× d⊂eqRn, where Rn=Rn1×·s×Rnd with each i⊂eqRni a non-degenerate simplex of ni points. We prove that any set S⊂eq Rn, with n=n1+·s +nd of positive upper Banach density necessarily contains an isometric copy of all sufficiently large dilates of the configuration . In particular any such set S⊂eq R2d contains a d-dimensional cube of side length λ, for all λ≥ λ0(S). We also prove analogous results with the underlying space being the integer lattice. The proof is based on a weak hypergraph regularity lemma and an associated counting lemma developed in the context of Euclidean spaces and the integer lattice.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.