Newton polygons are constructions over the p-adic numbers used to find information about the roots of a polynomial or power series. In this the- sis, we will first investigate the construction of the field Qp on the p-adic numbers. Then, we will use theorems such as Eisenstein’s Irreducibility Criterion, Newton’s Method, Hensel’s Lemma, and Strassman’s Theorem to build and justify Newton polygons.
Identifer | oai:union.ndltd.org:CLAREMONT/oai:http://scholarship.claremont.edu/do/oai/:scripps_theses-1175 |
Date | 15 March 2013 |
Creators | Ogburn, Julia J |
Publisher | Scholarship @ Claremont |
Source Sets | Claremont Colleges |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | Scripps Senior Theses |
Rights | © 2013 Julia J. Ogburn |
Page generated in 0.0016 seconds