Polynomial partitioning for a set of varieties

Abstract

Given a set of low-degree k-dimensional varieties in Rn, we prove that for any D 1, there is a non-zero polynomial P of degree at most D so that each component of Rn Z(P) intersects O(Dk-n ||) varieties of .

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…