Continuous Tur\'an numbers
Abstract
In this paper, we define a notion of containment and avoidance for subsets of R2. Then we introduce a new, continuous and super-additive extremal function for subsets P ⊂eq R2 called px(n, P), which is the supremum of μ2(S) over all open P-free subsets S ⊂eq [0, n]2, where μ2(S) denotes the Lebesgue measure of S in R2. We show that px(n, P) fully encompasses the Zarankiewicz problem and more generally the 0-1 matrix extremal function ex(n, M) up to a constant factor. More specifically, we define a natural correspondence between finite subsets P ⊂eq R2 and 0-1 matrices MP, and we prove that px(n, P) = (ex(n, MP)) for all finite subsets P ⊂eq R2, where the constants in the bounds depend only on the distances between the points in P. We also discuss bounded infinite subsets P for which px(n, P) grows faster than ex(n, M) for all fixed 0-1 matrices M. In particular, we show that px(n, P) = (n2) for any open subset P ⊂eq R2. We prove an even stronger result, that if QP is the set of points with rational coordinates in any open subset P ⊂eq R2, then px(n, QP) = (n2). Finally, we obtain a strengthening of the Kovari-S\'os-Tur\'an theorem that applies to infinite subsets of R2. Specifically, for subsets Ps, t, c ⊂eq R2 consisting of t horizontal line segments of length s with left endpoints on the same vertical line with consecutive segments a distance of c apart, we prove that px(n, Ps, t,c) = O(s1tn2-1t), where the constant in the bound depends on t and c. When t = 2, we show that this bound is sharp up to a constant factor that depends on c.
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.