2000 character limit reached
Transfinitely valued Euclidean domains have arbitrary indecomposable order type (1703.02631v2)
Published 7 Mar 2017 in math.AC, math.NT, and math.RA
Abstract: We prove that for every indecomposable ordinal there exists a (transfinitely valued) Euclidean domain whose minimal Euclidean norm is of that order type. Conversely, any such norm must have indecomposable type, and so we completely characterize the norm complexity of Euclidean domains. Modifying this construction, we also find a finitely valued Euclidean domain with no multiplicative integer valued norm.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.