The polynomial zero-avoidance conjecture on the unit ball

Let P1,,PNR[x1,,xd]P_1,\ldots, P_N\in \mathbb R[x_1, \ldots, x_d] be polynomials, and let δ1,,δN>0\delta_1,\ldots, \delta_N>0 satisfy

k=1NδkdegPk1.\sum_{k=1}^N \delta_k\deg P_k\leq 1.

Polynomial zero-avoidance conjecture. There exists a point pBdRdp\in B^d\subset\mathbb R^d such that, for every k=1,,Nk=1,\ldots,N, the point pp is at distance at least δk\delta_k from the zero set of PkP_k.

This conjecture simultaneously generalizes Bang's theorem and zero-avoidance results for polynomials. The supplied text gives partial results and a complex projective analogue, but does not state that the real-ball conjecture has been resolved.

Sources & referencesView supporting material

Primary source

Alexey Glazyrin, Roman Karasev and Alexandr Polyanskii, “Covering by planks and avoiding zeros of polynomials”, arXiv:2112.05382 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.