Maximal 2-Extensions of Number Fields With Limited Ramification
Perry, David Michael
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/86986
Description
Title
Maximal 2-Extensions of Number Fields With Limited Ramification
Author(s)
Perry, David Michael
Issue Date
1999
Doctoral Committee Chair(s)
Boston, Nigel
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Mathematics
Language
eng
Abstract
Let K be a number field, p a rational prime, and S a finite set of primes of K, none of which lies above p. Let K S be the maximal pro-p extension of K unramified outside S, and let GS = Gal(KS/K). In the case K = Q , p = 2, S a set of two odd primes, we find a presentation of GS given certain conditions on the primes. If the primes are both congruent to 3 modulo 4, G S is semidihedral with order explicitly given. When one prime is congruent to 3, the other congruent to 1 modulo 4, each a quadratic nonresidue of the other, then GS is a modular group with order explicitly given. The first two members of another (conjectural) family of GS are found. The use of computers in determining a presentation for GS for given S is illustrated in two appendices. The final chapter discusses computational approaches to finding candidates for pro-2 groups appearing as G S in the case where K is imaginary quadratic and S = O.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.