Computing $S$-unit groups of orders
Number Theory
2017-10-05 v1
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 -unit groups of orders. The algorithm is then used for some investigations concerning the congruence subgroup property.
Cite
@article{arxiv.1710.01517,
title = {Computing $S$-unit groups of orders},
author = {Sebastian Schönnenbeck},
journal= {arXiv preprint arXiv:1710.01517},
year = {2017}
}