Search arXivSearch

arXiv · 2608.02894

Compact Hyperbolic Coxeter Six-dimensional Polytopes With Ten Facets

Abstract

We show that, up to isometry, there is exactly one compact hyperbolic Coxeter 6-polytope with 10 facets: the polytope $P_{6,10}$ whose Coxeter diagram appears as Figure 5 of Burcroff, attributed there to Bugaenko. Together with the results of Lannér, Kaplinskaja, Esselmann and Felikson-Tumarkin, and the independent classifications of Burcroff and Ma-Zheng in dimensions 4 and 5, this completes the classification of compact hyperbolic Coxeter $d$-polytopes with $d+4$ facets in every dimension. We enumerate all 387 candidate combinatorial types from the complete database of planar order types on 10 points via affine Gale duality, reduce to 11 types using two combinatorial consequences of Lannér's classification and the known classifications with $d+2$ facets and in dimension 5 with 9 facets, and decide those 11 by an exhaustive search over Coxeter labellings with no a priori bound on the dihedral angles. The search terminates with machine-checked exhaustion certificates, and the unique surviving Gram matrix is certified exactly over $\mathbb{Q}(\sqrt2,\sqrt5)$ and independently by CoxIter. The emptiness verdicts are exact as well: forward checking, by integer and real quadratic-field arithmetic, empties ten of the 11 types on its own, and every labelling that reaches a screen and is not accepted is refuted exactly over $\mathbb{Q}(\sqrt2,\sqrt3,\sqrt5)$, by the non-vanishing of a single determinant or, in 19 cases, by interval arithmetic on a compactified domain. No verdict rests on a floating-point tolerance or on a bound on the ultraparallel weights. The same code path, unchanged, reproduces the known censuses of 51 polytopes in dimension 5 and 348 in dimension 4. Code, data and certificates are publicly available. Most of the software was written by an AI assistant under the author's direction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John Mcleod. 2026-08-03. Compact Hyperbolic Coxeter Six-dimensional Polytopes With Ten Facets. https://arxiv.org/abs/2608.02894

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO