Continuous Tur\'an numbers

From MaRDI portal
Publication:6367351

arXiv2105.04864MaRDI QIDQ6367351FDOQ6367351


Authors: Jesse Geneson Edit this on Wikidata


Publication date: 11 May 2021

Abstract: In this paper, we define a notion of containment and avoidance for subsets of mathbbR2. Then we introduce a new, continuous and super-additive extremal function for subsets PsubseteqmathbbR2 called px(n,P), which is the supremum of mu2(S) over all open P-free subsets Ssubseteq[0,n]2, where mu2(S) denotes the Lebesgue measure of S in mathbbR2. 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 PsubseteqmathbbR2 and 0-1 matrices MP, and we prove that px(n,P)=Theta(ex(n,MP)) for all finite subsets PsubseteqmathbbR2, 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)=Theta(n2) for any open subset PsubseteqmathbbR2. We prove an even stronger result, that if QP is the set of points with rational coordinates in any open subset PsubseteqmathbbR2, then px(n,QP)=Theta(n2). Finally, we obtain a strengthening of the KH{o}vari-S'{o}s-Tur'{a}n theorem that applies to infinite subsets of mathbbR2. Specifically, for subsets Ps,t,csubseteqmathbbR2 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(sfrac1tn2frac1t), 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.





Recommendations








This page was built for publication: Continuous Tur\'an numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367351)