Papers › All 2-neighborly d-polytopes with at most d + 9 facets
All 2-neighborly d-polytopes with at most d + 9 facets
Aleksandr N. Maksimenko, Dmitry V. Gribanov, Dmitry S. Malyshev
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We give a complete enumeration of all 2-neighborly d-polytopes with d+9 and less facets. All of them are realized as 0/1-polytopes, except a 6-polytope P_(6,10,15) with 10 vertices and 15 facets, and pyramids over P_(6,10,15). In particular, we update the lower bounds for the number of facets of a 2-neighborly d-polytope P and showed that the number of facets of P is not less than the number of its vertices f₀(P) for f₀(P) ≤d + 10.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections