Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions (1406.2144v3)

Published 9 Jun 2014 in math.AG, cs.CG, math.AC, and math.CO

Abstract: We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean space of Guth and Katz, and its extension to hypersurfaces by Zahl and by Kaplan, Matou\v{s}ek, Sharir and Safernov\'a. We also present a bound for the number of incidences between points and hypersurfaces in the four-dimensional Euclidean space. It is an application of our partitioning theorem together with the refined bounds for the number of connected components of a semi-algebraic set by Barone and Basu.

Citations (38)

Summary

We haven't generated a summary for this paper yet.