Covering the permutohedron by affine hyperplanes

Abstract An almost cover of a finite set in the affine space is a collection of hyperplanes that together cover all points of the set except one. Using the polynomial method, we determine the minimum size of an almost cover of the vertex set of the permutohedron and address a few related questions.

Authors

Institutions

Publication Details

Journal
Acta Mathematica Academiae Scientiarum Hungaricae
Published
2024-09-13
DOI
https://doi.org/10.1007/s10474-024-01462-7
Citations
1
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.36
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Covering the permutohedron by affine hyperplanes

Gábor Hegedüs, GY. Károlyi
1 citations
Acta Mathematica Academiae Scientiarum Hungaricae
Graph Labeling and Dimension Problems
0.36
article

Covering the permutohedron by affine hyperplanes

Gábor Hegedüs, GY. Károlyi
article en
1 citations

Abstract

Abstract An almost cover of a finite set in the affine space is a collection of hyperplanes that together cover all points of the set except one. Using the polynomial method, we determine the minimum size of an almost cover of the vertex set of the permutohedron and address a few related questions.

Acta Mathematica Academiae Scientiarum HungaricaeVol. 174(2)
Obuda University (HU), Eötvös Loránd University (HU), HUN-REN Alfréd Rényi Institute of Mathematics (HU)
Openalex Percentile: Top 36%
Graph Labeling and Dimension Problems
0.36
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.