Computing S-unit groups of orders

DOI10.1142/S1793042121500342MaRDI QIDQ6292133arXivFDO

Authors Sebastian Schönnenbeck

Publication date 4 October 2017

Published in arXiv

Full work available at URL https://doi.org/10.1142/S1793042121500342

Mathematics Subject Classification ID

Units, groups of units (associative rings and algebras) (16U60) Groups with a (BN)-pair; buildings (20E42) Linear algebraic groups over local fields and their integers (20G25) Linear algebraic groups over global fields and their integers (20G30) Fuchsian groups and their generalizations (group-theoretic aspects) (20H10)

arXiv classification

math.NT

Abstract: Based on the general strategy described by Borel and Serre and the Voronoi algorithm for computing unit groups of orders we present an algorithm for finding presentations of $S$-unit groups of orders. The algorithm is then used for some investigations concerning the congruence subgroup property.

This page was built for publication: Computing $S$-unit groups of orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6292133)