arXiv · 1710.01517
Computing $S$-unit groups of orders
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.
Explore related subjects
Keep this discovery
Sebastian Schönnenbeck. 2017-10-04. Computing $S$-unit groups of orders. https://arxiv.org/abs/1710.01517
Cite the original work for its findings. Save a collection to share your selection of sources.