2000 character limit reached
Cutting lemma and Zarankiewicz's problem in distal structures
Published 3 Dec 2016 in math.LO, cs.CG, and math.CO | (1612.00908v2)
Abstract: We establish a cutting lemma for definable families of sets in distal structures, as well as the optimality of the distal cell decomposition for definable families of sets on the plane in $o$-minimal expansions of fields. Using it, we generalize the results in [J. Fox, J. Pach, A. Sheffer, A. Suk, and J. Zahl. "A semi-algebraic version of Zarankiewicz's problem"] on the semialgebraic planar Zarankiewicz problem to arbitrary $o$-minimal structures, in particular obtaining an $o$-minimal generalization of the Szemer\'edi-Trotter theorem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.