Covering the Permutohedron by Affine Hyperplanes

arXiv2305.06202MaRDI QIDQ6510047FDOQ6510047

Authors: Gábor Hegedüs, Gyula Károlyi 

Abstract: The vertices of the permutohedron can be covered by one hyperplane in the $n$ dimensional affine space. We prove here that any set of hyperplanes that covers all the vertices of the permutohedron but one contains at least $nchoose2$ hyperplanes. Our proof is based on a new variant of the Combinatorial Nullstellensatz.

This page was built for publication: Covering the Permutohedron by Affine Hyperplanes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6510047)