View Item 
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        JavaScript is disabled for your browser. Some features of this site may not work without it.

        Browse

        All of UU Student Theses RepositoryBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

        Computation of Units in Number Fields

        Thumbnail
        View/Open
        main.pdf (519.0Kb)
        Publication date
        2016
        Author
        Jacobs, S.J.
        Metadata
        Show full item record
        Summary
        We discuss three algorithms to find small norm elements in number fields. One of these algorithms is a continued fraction-like algorithm based on the LLL-reduction of positive definite quadratic forms as suggested by Beukers. The other two algorithms are adaptations of that algorithm. We discuss how to find units from these small norm elements and how to extract a system of independent units from that. We discuss properties of these algorithms and compare them to algorithms by Cohen, Diaz y Diaz, Olivier, by Buchmann, Peth\H{o} and by Pohst, Zassenhaus. We run tests on an implementation of these algorithms in Mathematica.
        URI
        https://studenttheses.uu.nl/handle/20.500.12932/22926
        Collections
        • Theses
        Utrecht university logo