SearcharxivSearch

arXiv subjects

John Mcleod

Publications and source records attributed to John Mcleod.

4 recordsLinked to original sources

Compact Hyperbolic Coxeter Six-dimensional Polytopes With Ten Facets

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\'er, 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\'er'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.

math.CO

Validating Gaussian Process Models with Simulation-Based Calibration

Gaussian process priors are a popular choice for Bayesian analysis of regression problems. However, the implementation of these models can be complex, and ensuring that the implementation is correct can be challenging. In this paper we introduce Gaussian process simulation-based calibration, a procedure for validating the implementation of Gaussian process models and demonstrate the efficacy of this procedure in identifying a bug in existing code. We also present a novel application of this procedure to identify when marginalisation of the model hyperparameters is necessary.

cs.LG

Reflective and quasi-reflective Bianchi groups

A discrete subgroup of the group of isometries of the hyperbolic space is called reflective if up to a finite index it is generated by reflections in hyperplanes. The main result of this paper is a complete classification of the reflective (and quasi-reflective) subgroups among the Bianchi groups and their extensions.

math.GR