Glazyrin–Karasev–Polyanskii polynomial plank conjecture

About 4 years old · traced to

Let P1,…,PN∈R[x1,…,xd]P_1,\ldots,P_N\in\mathbb R[x_1,\ldots,x_d] be nonzero polynomials, let Bd⊂RdB^d\subset\mathbb R^d be the unit ball, and let δ1,…,δN>0\delta_1,\ldots,\delta_N>0 satisfy

∑k=1Nδkdeg⁡Pk≤1.\sum_{k=1}^N\delta_k\deg P_k\leq 1.

Polynomial plank conjecture. There exists a point p∈Bdp\in B^d such that, for every k=1,…,Nk=1,\ldots,N, the distance from pp to the zero set of PkP_k is at least δk\delta_k.

This conjecture extends the one-polynomial polynomial plank theorem to different distances from several zero sets. The paper attributes it to the authors' earlier work and does not state that it has been resolved.

References

Primary source

Alexey Glazyrin, Roman Karasev and Alexandr Polyanskii, “Extensions of polynomial plank covering theorems”, arXiv:2211.10886 (2024).

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.