Hyperplane covering conjecture for the permutohedron

From papers

Let PnP_n be the permutohedron with vertex set contained in the hyperplane

H0 ⁣:i=1nxi=(n+12).H_0\colon \sum_{i=1}^n x_i={{n+1}\choose 2}.

Let H1,,HmH_1,\ldots,H_m be affine hyperplanes different from H0H_0 whose union contains the vertex set of PnP_n. Hyperplane covering conjecture. If nn is odd, then mnm\ge n; if n4n\ge 4 is even, then mn1m\ge n-1. This conjecture asserts that the explicit covers described in the paper are extremal; its resolution is not provided in the source.

Progress summary

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

Sources & referencesView supporting material

Primary source

Gábor Hegedüs and Gyula Károlyi, “Covering the Permutohedron by Affine Hyperplanes”, arXiv:2305.06202 (2024).

Solutions 0

No solutions have been posted yet.