On computing quaternion quotient graphs for function fields
Gebhard B\"ockle, Ralf Butenuth

TL;DR
This paper presents an algorithm to compute fundamental domains and group presentations for quaternion unit groups acting on Bruhat-Tits trees over function fields, extending classical Fuchsian group actions.
Contribution
It introduces a novel algorithm for fundamental domain computation and explicit group presentation for quaternion unit groups over function fields.
Findings
Algorithm computes fundamental domains efficiently.
Provides explicit generators and relations for quaternion unit groups.
Establishes an upper bound on the algorithm's running time.
Abstract
Let be a maximal -order in a division quaternion algebra over which is split at the place . The present article gives an algorithm to compute a fundamental domain for the action of the group of units on the Bruhat-Tits tree associated to . This action is a function field analog of the action of a co-compact Fuchsian group on the upper half plane. The algorithm also yields an explicit presentation of the group in terms of generators and relations. Moreover we determine an upper bound for its running time using that is {\em almost} Ramanujan.
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
TopicsAdvanced Algebra and Geometry · Coding theory and cryptography · Algebraic Geometry and Number Theory
