Computing a Generating Set of Arithmetic Kleinian Groups
Gregory Muller

TL;DR
This paper develops a hyperbolic geometry-based algorithm to compute generating sets for specific arithmetic Kleinian groups, demonstrated on a quadratic form, with explicit matrices provided.
Contribution
It introduces a novel method combining hyperbolic geometry techniques to compute generators of certain arithmetic Kleinian groups.
Findings
Successfully computed generating sets for the group associated with Q_7
Explicit matrices for the generators are provided
Demonstrates the effectiveness of geometric methods in group computation
Abstract
The goal of this paper is to demonstrate the use of techniques from hyperbolic geometry to compute generating sets of certain subgroups of ; specifically, for some integral quadratic form of signature that does not represent 0. The algorithm is illustrated for the form , and explicit generating matrices are found.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Mathematics and Applications · Advanced Combinatorial Mathematics
