Abstract
A subset of the -dimensional grid is called -dimensional corner-free if it does not contain a set of points of the form for some and , where is the standard basis of . We define the maximum size of a -dimensional corner-free subset of by . In this paper, we show that the number of -dimensional corner-free subsets of the -dimensional grid is at most for infinitely many values of . Our main tool for the proof is a supersaturation result for -dimensional corners in sets of size and the hypergraph container method.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.