2000 character limit reached
An o-minimal Szemerédi-Trotter theorem
Published 22 Nov 2016 in math.LO, cs.CG, and math.CO | (1611.07362v3)
Abstract: We prove an analog of the Szemer\'edi-Trotter theorem in the plane for definable curves and points in any o-minimal structure over an arbitrary real closed field $\mathrm{R}$. One new ingredient in the proof is an extension of the well known crossing number inequality for graphs to the case of embeddings in any o-minimal structure over an arbitrary real closed field.
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.