In the usual definition of a Euclidean domain, a ring has a norm function whose codomain is the positive integers. It was noticed by Motzkin in 1949 that the codomain could be replaced by any well-ordered set. This motivated the study of transfinite Euclidean domains in which the codomain of the norm function is replaced by the class of ordinals. We prove that there exists a (transfinitely valued) Euclidean Domain with Euclidean order type for every indecomposable ordinal. Modifying the construction, we prove that there exists a Euclidean Domain with no multiplicative norm. Following a definition of Clark and Murty, we define a set of admissible primes. We develop an algorithm that can be used to find sets of admissible primes in the ring of integers of quadratic extensions of the rationals and provide some examples.
| Identifer | oai:union.ndltd.org:BGMYU2/oai:scholarsarchive.byu.edu:etd-7918 |
| Date | 01 July 2018 |
| Creators | Tombs, Vandy Jade |
| Publisher | BYU ScholarsArchive |
| Source Sets | Brigham Young University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | All Theses and Dissertations |
| Rights | http://lib.byu.edu/about/copyright/ |
Page generated in 0.0021 seconds