Polynomial partitioning conjecture for irreducible varieties
Statement
Let be an irreducible complex algebraic variety of dimension and degree . Let be a finite point set, and let with . A real -partitioning polynomial for is a real polynomial whose complement has at most connected components, each containing at most points of . Polynomial partitioning conjecture. There exists a real -partitioning polynomial for of degree at most
that does not vanish identically on . The preceding key lemma gives the weaker bound for varieties with equidimensional irreducible components; the conjecture proposes the sharper degree bound for an irreducible variety under the condition .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.