To cover a permutohedron
Pith reviewed 2026-05-18 16:36 UTC · model grok-4.3
The pith
The vertices of the permutohedron cannot be covered by fewer than n affine hyperplanes besides the sum hyperplane when n is odd, or n-1 when even.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
If the vertices of P_n are contained in the union of m affine hyperplanes different from H_n, then m ≥ n when n ≥ 3 is odd, and m ≥ n-1 when n ≥ 4 is even. The proof reduces the covering question to linear dependence or algebraic independence conditions on the coordinates and yields an algebraic criterion for the non-standard case generated by arbitrary distinct reals.
What carries the argument
Reduction of the covering question to linear dependence or algebraic independence conditions on the coordinates of the permutation points.
Load-bearing premise
The vertices are exactly the points whose coordinates are permutations of n distinct real numbers, and any covering hyperplanes must be affine and different from the sum hyperplane.
What would settle it
An explicit collection of only n-1 affine hyperplanes different from H_n whose union contains every vertex of P_3 would show the claimed lower bound for odd n does not hold.
Figures
read the original abstract
The permutohedron $P_n$ of order $n$ is a polytope embedded in $\mathbb{R}^n$ whose vertex coordinates are permutations of the first $n$ natural numbers. It is obvious that $P_n$ lies on the hyperplane $H_n$ consisting of points whose coordinates sum up to $n(n+1)/2$. We prove that if the vertices of $P_n$ are contained in the union of $m$ affine hyperplanes different from $H_n$, then $m\geq n$ when $n \geq 3$ is odd, and $m \geq n-1$ when $n \geq 4$ is even. This result has been established by Pawlowski in a more general form. Our proof is shorter, rather different, and gives an algebraic criterion for a non-standard permutohedron generated by $n$ distinct real numbers to require at least $n$ non-trivial hyperplanes to cover its vertices.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proves that if the vertices of the permutohedron P_n (with coordinates permutations of 1 to n) are contained in the union of m affine hyperplanes different from the sum hyperplane H_n, then m ≥ n when n ≥ 3 is odd and m ≥ n-1 when n ≥ 4 is even. It also supplies an algebraic criterion for the minimal number of non-trivial hyperplanes needed to cover the vertices of a non-standard permutohedron generated by any n distinct real numbers.
Significance. The result supplies a short, independent proof of a lower bound previously obtained by Pawlowski in greater generality, together with an algebraic criterion that reduces the covering question to linear dependence conditions on the coordinate permutations. This criterion may prove useful for checking specific instances or for extensions to other polytopes with symmetric-group symmetry. The reduction steps rely on standard facts about affine equations a · x = b with a not parallel to (1,…,1) and the action of S_n.
minor comments (2)
- [§1] The introduction could briefly recall the precise definition of an affine hyperplane in R^n and the condition that it differs from H_n (i.e., its normal vector is not a scalar multiple of (1,…,1)).
- [§3] A short remark on how the algebraic criterion specializes to the standard case (coordinates 1 through n) would help readers verify the main theorem directly from the criterion.
Simulated Author's Rebuttal
We thank the referee for their positive assessment of the manuscript and for recommending acceptance. The referee's summary correctly identifies the main results: the lower bounds on the number of non-trivial affine hyperplanes covering the vertices of the standard permutohedron P_n, together with the algebraic criterion for non-standard permutohedra generated by arbitrary distinct real numbers.
Circularity Check
No significant circularity; independent re-proof of external result
full rationale
The paper explicitly positions its argument as a shorter, rather different proof of a result first established by Pawlowski (an external author), reducing the hyperplane-covering question to standard linear dependence and algebraic independence facts on permutations of coordinates under the symmetric group action and affine equations a·x = b with a not parallel to (1,...,1). No load-bearing step reduces by construction to a fitted parameter, self-definition, or self-citation chain; the algebraic criterion for the non-standard case is derived directly from the same linear-algebraic setup without importing uniqueness theorems from the authors' prior work. The derivation remains self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (1)
- standard math Affine hyperplanes in R^n are defined by linear equations, and their intersections with the permutohedron can be analyzed via coordinate sums and linear dependence.
Reference graph
Works this paper leans on
-
[1]
Forster.Lectures on Riemann Surfaces
O. Forster.Lectures on Riemann Surfaces. Graduate Texts in Mathematics. Springer, 1981
work page 1981
-
[2]
P. Griffiths and J. Harris.Principles of Algebraic Geometry. John Wiley & Sons, 1978
work page 1978
-
[3]
G. Harris and C. Martin. The roots of a polynomial vary continuously as a function of the coefficients.Proceedings of the American Mathematical Society, 100(2):390–392, 1987
work page 1987
-
[4]
G. Heged¨ us and G. K´ arolyi. Covering the permutohedron by affine hyperplanes.Acta Mathematica Hungarica, 174(2):453–461, 2024
work page 2024
- [5]
-
[6]
G. Ziegler.Lectures on Polytopes. Graduate Texts in Mathematics. Springer, 1995. 4
work page 1995
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.