Proves lower bounds m ≥ n (odd n ≥ 3) and m ≥ n-1 (even n ≥ 4) on the number of non-trivial affine hyperplanes needed to cover permutohedron vertices, plus an algebraic criterion for non-standard cases.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
To cover a permutohedron
Proves lower bounds m ≥ n (odd n ≥ 3) and m ≥ n-1 (even n ≥ 4) on the number of non-trivial affine hyperplanes needed to cover permutohedron vertices, plus an algebraic criterion for non-standard cases.